id:A089080 - OEIS Search Results

Search: id:A089080

Displaying 1-1 of 1 results found.

page 1

Sequence is S(infinity) where S(1)={1,2} and S(n)=S(n-1)S'(n-1), where S'(k) is obtained from S(k) by replacing the single 1 by the least integer not occurring in S(k).

+0
3

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

	OFFSET	`1,2`
	FORMULA	`sum(k=1, n, a(k))= 3n+O(log(n)) ( sum(k=1, n, a(k))< 3n )`
	EXAMPLE	`S(1)={1,2} then S'(1)={3,2} and sequence begins 1,2,3,2`
	CROSSREFS	`Essentially the same as A085058.` `Sequence in context: A050206 A127237 A066482 this_sequence A123725 A085058 A080771` `Adjacent sequences: A089077 A089078 A089079 this_sequence A089081 A089082 A089083`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 04 2003`

page 1

Search completed in 0.002 seconds

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.

AT&T Labs Research