id:A080639 - OEIS Search Results

Search: id:A080639

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "for n>1, n is a member of the sequence if and only if a(n) is even".

+0
6

1, 2, 5, 7, 8, 9, 10, 12, 14, 16, 17, 18, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.` `B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)` `Index entries for sequences of the a(a(n)) = 2n family`
	FORMULA	`{a(a(n))} = {1, 2, 2i, i >= 4}.`
	CROSSREFS	`Cf. A079253, A079000.` `Adjacent sequences: A080636 A080637 A080638 this_sequence A080640 A080641 A080642` `Sequence in context: A084959 A021799 A061770 this_sequence A047483 A047388 A050086`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas and Benoit Cloitre, Feb 28 2003`
	EXTENSIONS	`More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Feb 28 2003`

page 1

Search completed in 0.003 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research