The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A215130 Odd squarefree n not divisible by 3 such that n/phi(n) > 2, where phi is Euler's totient function. 1
 37182145, 46881835, 50115065, 59814755, 1078282205, 1152646495, 1375739365, 1453336885, 1524467945, 1598832235, 1734627895, 1747560815, 1759302545, 1854257405, 1922155235, 1966279315, 1970653685, 2015918905, 2054717665, 2099812715, 2154947795, 2193746555 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Terms in A091495 not divisible by 3. The first 5000 terms are divisible by both 5 and 7. a(2276) = 112435426285 is the smallest term not divisible by 11. - Donovan Johnson, Nov 03 2013 LINKS Donovan Johnson, Table of n, a(n) for n = 1..5000 PROG (PARI) forstep(n=1, 2193746557, [4, 2], if(issquarefree(n), if(n/eulerphi(n)>2, print1(n ", ")))) CROSSREFS Cf. A091495, A000010. Sequence in context: A340713 A263347 A263560 * A286037 A034645 A204054 Adjacent sequences: A215127 A215128 A215129 * A215131 A215132 A215133 KEYWORD nonn AUTHOR Donovan Johnson, Aug 04 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 12:20 EST 2022. Contains 358416 sequences. (Running on oeis4.)