Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Nov 17 2024 07:18:44
%S 8,20,220,272,300,368,416,456,500,656,732,848,876,1092,1160,1212,1236,
%T 1328,1376,1424,1568,1624,1716,1808,2144,2244,2336,2420,2460,2480,
%U 2528,2556,2768,3056,3080,3252,3320,3344,3536,3560,3612,3728,3732,3900,4016
%N Numbers k such that phi(x) = k has exactly 5 solutions.
%H Amiram Eldar, <a href="/A060668/b060668.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from T. D. Noe)
%H Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%e 8 = phi(15) = phi(16) = phi(20) = phi(24) = phi(30).
%t a = Table[ 0, {5000} ]; Do[ p = EulerPhi[ n ]; If[ p < 5001, a[[ p ]]++ ], {n, 1, 15000} ]; Select[ Range[ 5000 ], a[[ # ]] == 5 & ]
%o (PARI) is(n)=sum(k=1,n,eulerphi(k)==n)==5 \\ _Charles R Greathouse IV_, Mar 03 2014
%o (PARI) is(k) = invphiNum(k) == 5 \\ _Amiram Eldar_, Nov 17 2024, using _Max Alekseyev_'s invphi.gp
%Y Cf. A00010.
%Y Number of solutions: A007617 (0), A007366 (2), A007367 (3), A060667 (4), this sequence (5), A060669 (6), A060670 (7), A060671 (8), A060672 (9), A060673 (10), A060674 (11), A060675 (12).
%K nonn
%O 1,1
%A _Robert G. Wilson v_, Apr 18 2001