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

 

Logo
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

%I #15 Nov 03 2013 12:18:55

%S 37182145,46881835,50115065,59814755,1078282205,1152646495,1375739365,

%T 1453336885,1524467945,1598832235,1734627895,1747560815,1759302545,

%U 1854257405,1922155235,1966279315,1970653685,2015918905,2054717665,2099812715,2154947795,2193746555

%N Odd squarefree n not divisible by 3 such that n/phi(n) > 2, where phi is Euler's totient function.

%C Terms in A091495 not divisible by 3.

%C 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 Donovan Johnson, <a href="/A215130/b215130.txt">Table of n, a(n) for n = 1..5000</a>

%o (PARI) forstep(n=1, 2193746557, [4,2], if(issquarefree(n), if(n/eulerphi(n)>2, print1(n ", "))))

%Y Cf. A091495, A000010.

%K nonn

%O 1,1

%A _Donovan Johnson_, Aug 04 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)