id:A068212 - OEIS Search Results

Search: id:A068212

Displaying 1-1 of 1 results found.

page 1

EulerPhi of n is divided by its largest prime factor.

+0
3

1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 4, 2, 4, 4, 8, 2, 6, 4, 4, 2, 2, 4, 4, 4, 6, 4, 4, 4, 6, 8, 4, 8, 8, 4, 12, 6, 8, 8, 8, 4, 6, 4, 8, 2, 2, 8, 6, 4, 16, 8, 4, 6, 8, 8, 12, 4, 2, 8, 12, 6, 12, 16, 16, 4, 6, 16, 4, 8, 10, 8, 24, 12, 8, 12, 12, 8, 6, 16, 18, 8, 2, 8, 32, 6, 8, 8, 8, 8, 24, 4, 12, 2, 24 (list; graph; listen)

	OFFSET	`3,3`
	FORMULA	`a(n)=A052126[A000010(n)]=A000010(n)/A068211(n)=A000010(n)/A006530[A000010(n)]`
	CROSSREFS	`Cf. A000010, A006530, A052126, A068211.` `Sequence in context: A029237 A078641 A072628 this_sequence A064131 A105194 A008335` `Adjacent sequences: A068209 A068210 A068211 this_sequence A068213 A068214 A068215`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Feb 21 2002`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research