The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A276035 Least k such that n divides phi(k^k) (k > 0). 1
1, 2, 3, 4, 5, 3, 7, 4, 3, 5, 11, 6, 13, 7, 15, 4, 17, 3, 19, 5, 7, 11, 23, 6, 5, 13, 6, 14, 29, 15, 31, 4, 33, 17, 35, 6, 37, 19, 13, 10, 41, 7, 43, 22, 15, 23, 47, 6, 7, 5, 51, 13, 53, 6, 11, 14, 19, 29, 59, 15, 61, 31, 21, 4, 65, 33, 67, 17, 69, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The first term that has 3 prime divisors is a(240) = 2*3*5.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
FORMULA
(log n)/W(log n) < a(n) <= n for n > 1. - Charles R Greathouse IV, Aug 16 2016
EXAMPLE
a(9) = 3 because 9 divides phi(3^3) = 18.
PROG
(PARI) a(n)=my(k = 1); while(eulerphi(k^k) % n, k++); k;
(PARI) a(n)=my(k=1); while(eulerphi(k)*Mod(k, n)^(k-1), k++); k \\ Charles R Greathouse IV, Aug 16 2016
CROSSREFS
Cf. A064447.
Sequence in context: A345931 A025492 A322445 * A077004 A064760 A002034
KEYWORD
nonn
AUTHOR
Altug Alkan, Aug 16 2016
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 12:18 EDT 2024. Contains 372630 sequences. (Running on oeis4.)