|
| |
|
|
A079253
|
|
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is even".
|
|
9
| |
|
|
0, 3, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 18, 19, 20, 22, 24, 26, 28, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 94, 96
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,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
| For a formula for a(n) see A079000.
a(a(n)) = 2n+4 for n >= 1.
|
|
|
EXAMPLE
| a(1) cannot be 1 because that would imply that the first term is even; it cannot be 2 because then the first term would be even despite 1's not being in the sequence; therefore a(1)=3, which creates no contradictions and the third term is the first even term of the sequence.
|
|
|
CROSSREFS
| Equals A079000 - 1.
Sequence in context: A047330 A093511 A039041 * A076054 A139636 A159559
Adjacent sequences: A079250 A079251 A079252 * A079254 A079255 A079256
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Matthew Vandermast (ghodges14(AT)comcast.net) and N. J. A. Sloane (njas(AT)research.att.com), Feb 04 2003
|
| |
|
|
