Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063667
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A063667
%S A063667 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,
%T A063667 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,
%U A063667 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 A063667 Number of solutions of EulerPhi[x]=12n+2.
%e A063667 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 A063667 with(numtheory): [seq(nops(invphi(2+12*j)),j=1..10000)];
%Y A063667 A000010, A005277, A002202.
%Y A063667 Sequence in context: A130779 A130706 A000038 this_sequence A014083 A112315 
               A005926
%Y A063667 Adjacent sequences: A063664 A063665 A063666 this_sequence A063668 A063669 
               A063670
%K A063667 nonn
%O A063667 1,9
%A A063667 Labos E. (labos(AT)ana.sote.hu), Aug 22 2001

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research