id:A063667 - OEIS Search Results

Search: id:A063667

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	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 this_sequence A014083 A112315 A005926` `Adjacent sequences: A063664 A063665 A063666 this_sequence A063668 A063669 A063670`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Aug 22 2001`

page 1

Search completed in 0.002 seconds

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research