[go: up one dir, main page]

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!)
A058321 Number of x such that phi(x) = 2^n. 2
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
If there are only 5 Fermat primes (A019434), then a(n) = 32 for n > 31. - T. D. Noe, Jun 21 2012 [Corrected by Jeppe Stig Nielsen, Oct 02 2021.]
The first unknown term is a(8589934592) which depends on whether A000215(33) is composite or prime. - Jeppe Stig Nielsen, Oct 02 2021
LINKS
R. D. Carmichael, On Euler's phi-function, Bull. Amer. Math. Soc. 13 (1907), 241-243.
R. D. Carmichael, Erratum: On Euler's phi-function, Bull. Amer. Math. Soc. 54 (1948), 1192.
R. D. Carmichael, Erratum: Erratum: On Euler's phi-function, Bull. Amer. Math. Soc. 55 (1949), 212.
Eric W. Weisstein, MathWorld: Fermat prime
FORMULA
a(n) = A014197(2^n) = A014197(A000079(n)).
EXAMPLE
For n = 0, a(0) = 2 because phi(1) = phi(2) = 1.
For n = 5, invphi(32) gives 7 values as follows: Phi[{51,64,68,80,96,102,120}] = {32,32,32,32,32,32,32}.
MAPLE
with(numtheory):[seq(nops(invphi(2^i)), i=1..100)];
CROSSREFS
Sequence in context: A008684 A188462 A352530 * A318892 A323404 A056064
KEYWORD
nonn
AUTHOR
Labos Elemer, Dec 11 2000
EXTENSIONS
Added a(0) and corrected a(31) - T. D. Noe, Jun 21 2012
Correction of a(31) reverted; true value is a(31) = 33. - Jeppe Stig Nielsen, Oct 02 2021
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 August 29 18:55 EDT 2024. Contains 375518 sequences. (Running on oeis4.)