A111439 - OEIS

This site is supported by donations to The OEIS Foundation.

A111439

Variation of Golomb's sequence: a(n) is the number of times n appears with a(n) unequal to a(n-1).

1, 2, 3, 2, 3, 4, 3, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 8, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 14, 15, 14, 15, 14, 15, 14, 15, 14, 15, 14, 15, 16, 15, 16, 17, 16, 17, 16, 17 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`a(n) is understood to be the smallest number >=a(n-2) fitting the description.`
	CROSSREFS	`Bisections: A080606 and A080605. Cf. A001462 (Golomb's sequence).` `Sequence in context: A045781 A045670 A194960 * A020986 A095161 A072106` `Adjacent sequences: A111436 A111437 A111438 * A111440 A111441 A111442`
	KEYWORD	`nonn`
	AUTHOR	`Floor van Lamoen (fvlamoen(AT)hotmail.com), Nov 14 2005`

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

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.