|
| |
|
|
A080034
|
|
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 3 mod 4".
|
|
1
| |
|
|
1, 3, 4, 7, 11, 6, 15, 19, 9, 23, 12, 27, 31, 14, 35, 39, 17, 43, 20, 47, 51, 22, 55, 59, 25, 63, 28, 67, 71, 30, 75, 79, 33, 83, 36, 87, 91, 38, 95, 99, 41, 103, 44, 107, 111, 46, 115, 119, 49, 123, 52, 127, 131, 54, 135, 139, 57, 143, 60, 147, 151, 62, 155, 159, 65, 163
(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)
|
|
|
CROSSREFS
| Equals A080033(n+1)-1.
Sequence in context: A193826 A032715 A002887 * A061447 A185506 A080591
Adjacent sequences: A080031 A080032 A080033 * A080035 A080036 A080037
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Mar 14 2003
|
|
|
EXTENSIONS
| More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Mar 23 2003
|
| |
|
|
