This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A215130 #15 Nov 03 2013 12:18:55 %S A215130 37182145,46881835,50115065,59814755,1078282205,1152646495,1375739365, %T A215130 1453336885,1524467945,1598832235,1734627895,1747560815,1759302545, %U A215130 1854257405,1922155235,1966279315,1970653685,2015918905,2054717665,2099812715,2154947795,2193746555 %N A215130 Odd squarefree n not divisible by 3 such that n/phi(n) > 2, where phi is Euler's totient function. %C A215130 Terms in A091495 not divisible by 3. %C A215130 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 %H A215130 Donovan Johnson, <a href="/A215130/b215130.txt">Table of n, a(n) for n = 1..5000</a> %o A215130 (PARI) forstep(n=1, 2193746557, [4,2], if(issquarefree(n), if(n/eulerphi(n)>2, print1(n ", ")))) %Y A215130 Cf. A091495, A000010. %K A215130 nonn %O A215130 1,1 %A A215130 _Donovan Johnson_, Aug 04 2012