A091316 - OEIS

This site is supported by donations to The OEIS Foundation.

A091316

a(1)=1, a(2)=2, then a(a(1)+a(2)+...+a(k))=a(k), fill in any undefined places with the rule a(n+1)=a(n)+1.

1, 2, 2, 3, 2, 3, 4, 3, 4, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6, 3, 4, 5, 6, 4, 5, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6, 3, 4, 5, 6, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 3, 4, 5, 6, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 4, 5, 6, 7, 8, 5, 6, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	FORMULA	`Is sum(k=1, n, a(k)) asymptotic to cnlog(n)*log(log(n)) with c=0.6...?`
	EXAMPLE	`a(a(1)+a(2))=a(2) therefore a(3)=a(2)=2. a(a(1)+a(2)+a(3))=a(3) therefore a(5)=2. So a(4) is undefined but from the rule a(4)=a(3)+1=3.`
	CROSSREFS	`Cf. A091309.` `Sequence in context: A051125 A131830 A147952 * A071825 A115727 A115726` `Adjacent sequences: A091313 A091314 A091315 * A091317 A091318 A091319`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 20 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 17:10 EST 2012. Contains 205644 sequences.