|
|
A032446
|
|
Number of solutions to phi(k) = 2n.
|
|
11
|
|
|
3, 4, 4, 5, 2, 6, 0, 6, 4, 5, 2, 10, 0, 2, 2, 7, 0, 8, 0, 9, 4, 3, 2, 11, 0, 2, 2, 3, 2, 9, 0, 8, 2, 0, 2, 17, 0, 0, 2, 10, 2, 6, 0, 6, 0, 3, 0, 17, 0, 4, 2, 3, 2, 9, 2, 6, 0, 3, 0, 17, 0, 0, 2, 9, 2, 7, 0, 2, 2, 3, 0, 21, 0, 2, 2, 0, 0, 7, 0, 12, 4, 3, 2, 12, 0, 2, 0, 8, 2, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
REFERENCES
|
Albert H. Beiler, "Recreations in the Theory of Numbers, The Queen of Mathematics Entertains," Second Edition, Dover Publications, Inc., NY, 1966, page 90.
|
|
LINKS
|
|
|
EXAMPLE
|
If n=8 then phi(x)=2*8=16 is satisfied for only a(8)=6 values of x, viz. 17, 32, 34, 40, 48, 60.
|
|
MAPLE
|
with(numtheory); [ seq(nops(invphi(2*n)), n=1..90) ];
|
|
MATHEMATICA
|
t = Table[0, {100} ]; Do[a = EulerPhi[n]; If[a < 202, t[[a/2]]++ ], {n, 3, 10^5} ]; t
|
|
PROG
|
(Magma) [#EulerPhiInverse( 2*n):n in [1..100]]; // Marius A. Burtea, Sep 08 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Ursula Gagelmann (gagelmann(AT)altavista.net)
|
|
EXTENSIONS
|
Extended by Robin Trew (trew(AT)hcs.harvard.edu).
|
|
STATUS
|
approved
|
|
|
|