This site is supported by donations to The OEIS Foundation.



110 people attended OEIS-50 (videos, suggestions); annual fundraising drive to start soon (donate); editors, please edit! (stack is over 300), your editing is more valuable than any donation.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063667 Number of solutions of EulerPhi[x]=12n+2. 1


%S 0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

%T 0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

%U 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

%N Number of solutions of EulerPhi[x]=12n+2.

%e Among the first 10000 cases only 16 invphi(12j+2) set are non-empty, always with 2 terms. E.g. n=8034, a(8034)=2 because 12*8034+2=96410 and invphi(96410)={96721,193442}.

%p with(numtheory): [seq(nops(invphi(2+12*j)),j=1..10000)];

%Y A000010, A005277, A002202.

%K nonn

%O 1,9

%A _Labos Elemer_, Aug 22 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified October 31 07:25 EDT 2014. Contains 248845 sequences.