id:A080752 - OEIS Search Results

Search: id:A080752

Displaying 1-1 of 1 results found.

page 1

a(1)=1; a(2)=8; for n > 2, a(n) is smallest integer greater than a(n-1) that satisfies the condition "n is in the sequence if and only if a(n) is odd.".

+0
3

1, 8, 10, 12, 14, 16, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Increases according to a pattern analogous to the one for A079000.`
	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)`
	CROSSREFS	`Cf. A079000, A080731.` `Sequence in context: A046031 A102758 A033872 this_sequence A020744 A008557 A161425` `Adjacent sequences: A080749 A080750 A080751 this_sequence A080753 A080754 A080755`
	KEYWORD	`easy,nonn`
	AUTHOR	`Matthew Vandermast (ghodges14(AT)comcast.net), Mar 08 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research