id:A064415 - OEIS Search Results

Search: id:A064415

Displaying 1-1 of 1 results found.

page 1

a(n) = iter(n) if n is even, a(n) = iter(n)-1 if n is odd, where iter(n) = A003434(n) = smallest number of iterations of Euler totient function phi needed to reach 1.

+0
3

0, 1, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 4, 3, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 5, 4, 5, 4, 4, 4, 4, 4, 5, 5, 4, 4, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 4, 5, 5, 5, 5, 5, 4, 6, 5, 5, 5, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 4, 6, 6, 5, 6, 5, 5, 6, 6, 5, 5, 6, 5, 6, 5, 6, 6, 5, 5, 6, 6, 6, 6, 6, 5 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`For all integers m >0 and n>0 a(m*n)=a(m)+a(n). The function a(n) is completely additive. The smallest integer q which satisfy the equation a(q)=n is 2^q, the greatest is 3^q. For all integers n>0, the counter image off n, a^-1(n) is finite.`
	CROSSREFS	`Cf. A000010, A003434, A064416.` `Sequence in context: A089050 A125173 A054725 this_sequence A086833 A010764 A029383` `Adjacent sequences: A064412 A064413 A064414 this_sequence A064416 A064417 A064418`
	KEYWORD	`nonn`
	AUTHOR	`Christian WEINSBERG (cweinsbe(AT)fr.packardbell.org), Sep 30 2001`
	EXTENSIONS	`More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 22 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research