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!)
A066420 Least m such that card(invphi(phi(m)))=n. 2

%I #12 May 13 2020 19:01:13

%S 1,3,5,15,13,51,37,41,35,65,187,397,2269,1059,313,73,337,247,937,185,

%T 689,1139,2057,403,2827,485,323,1321,3697,241,769,9001,433,7129,4201,

%U 527,577,1297,1201,15937,3313,3281,3379,949,3121,7519,3889,779,1763

%N Least m such that card(invphi(phi(m)))=n.

%H T. D. Noe, <a href="/A066420/b066420.txt">Table of n, a(n) for n = 2..1023</a>

%F a(n) = A049283(A007374(n)). - _Max Alekseyev_, Apr 12 2005

%Y Cf. A049283, A007374.

%Y Cf. A224531, A224532.

%K nonn

%O 2,2

%A _Vladeta Jovovic_, Dec 25 2001

%E More terms from _Max Alekseyev_, Apr 12 2005

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 24 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)