login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

%I

%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 nonempty, 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, A002202, A005277.

%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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 10:22 EST 2016. Contains 278699 sequences.