|
Search: id:A080455
|
|
|
| A080455 |
|
a(1)=1; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 otherwise. |
|
+0
14
|
|
| 1, 5, 9, 13, 13, 17, 21, 25, 25, 29, 33, 37, 37, 41, 45, 49, 49, 53, 57, 61, 61, 65, 69, 73, 73, 77, 81, 85, 85, 89, 93, 97, 97, 101, 105, 109, 109, 113, 117, 121, 121, 125, 129, 133, 133, 137, 141, 145, 145, 149, 153, 157, 157, 161, 165, 169, 169, 173
(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)
|
|
FORMULA
|
For m>=1, a(4m) = a(4m+1) = 12m+1, a(4m+2) = 12m+5, a(4m+3) = 12m+9.
Or, shorter: a(n)=4*n+1- 4*floor((n+3)/4). - Benoit Cloitre, Mar 20, 2003
|
|
CROSSREFS
|
Cf. A080456-A080458, A080036, A080037.
Sequence in context: A079355 A080781 A079357 this_sequence A122798 A130333 A080579
Adjacent sequences: A080452 A080453 A080454 this_sequence A080456 A080457 A080458
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 20 2003
|
|
|
Search completed in 0.002 seconds
|
