id:A032358 - OEIS Search Results

Search: id:A032358

Displaying 1-1 of 1 results found.

page 1

Number of iterations of phi(n) needed to reach 2.

+0
3

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

	OFFSET	`3,3`
	COMMENT	`a(n) = A003434(n)-1 = A049108(n)-2.`
	REFERENCES	`Catlin: Concerning the iterated phi-function. Amer Math. Monthly 77 (1970), pp. 60-61.`
	FORMULA	`a(n) = a(phi(n))+1, a(1) = -1. - Vladeta Jovovic, Apr 29 2003`
	CROSSREFS	`Sequence in context: A113793 A083552 A078704 this_sequence A011960 A008615 A103221` `Adjacent sequences: A032355 A032356 A032357 this_sequence A032359 A032360 A032361`
	KEYWORD	`nice,nonn,easy`
	AUTHOR	`Ursula Gagelmann (gagelmann(AT)altavista.net)`

page 1

Search completed in 0.002 seconds

Last modified December 20 13:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research