id:A076640 - OEIS Search Results

Search: id:A076640

Displaying 1-1 of 1 results found.

page 1

a(1)=1, a(n) = a(n-phi(n)) + 1.

+0
2

1, 2, 2, 3, 2, 4, 2, 4, 3, 5, 2, 5, 2, 5, 3, 5, 2, 6, 2, 6, 4, 6, 2, 6, 3, 6, 4, 6, 2, 7, 2, 6, 3, 7, 3, 7, 2, 7, 4, 7, 2, 8, 2, 7, 5, 7, 2, 7, 3, 8, 3, 7, 2, 8, 4, 7, 5, 8, 2, 8, 2, 7, 5, 7, 3, 8, 2, 8, 4, 8, 2, 8, 2, 8, 4, 8, 3, 9, 2, 8, 5, 9, 2, 9, 5, 8, 3, 8, 2, 9, 3, 8, 4, 8, 3, 8, 2, 8, 5, 9, 2, 9, 2, 8, 6 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	FORMULA	`It seems that for n large enough : ln(n) < (1/n)*sum(k=1, n, a(k)) < ln(n)+ln(ln(n))`
	PROGRAM	`(PARI) a(n)=if(n<2, 1, a(n-eulerphi(n))+1)`
	CROSSREFS	`A053475(n) - 1.` `Sequence in context: A114102 A144373 A086292 this_sequence A134681 A144372 A049238` `Adjacent sequences: A076637 A076638 A076639 this_sequence A076641 A076642 A076643`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 23 2002`

page 1

Search completed in 0.002 seconds

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.

AT&T Labs Research