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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063667 Number of solutions of EulerPhi[x]=12n+2. 1
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, 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, 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 (list; graph; refs; listen; history; internal format)
OFFSET

1,9

EXAMPLE

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}.

MAPLE

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

CROSSREFS

A000010, A005277, A002202.

Sequence in context: A130779 A130706 A000038 * A014083 A112315 A005926

Adjacent sequences:  A063664 A063665 A063666 * A063668 A063669 A063670

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 22 2001

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

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

Last modified February 13 20:37 EST 2012. Contains 205554 sequences.