|
Search: id:A080900
|
|
|
| A080900 |
|
a(1)=1; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise. |
|
+0
14
|
|
| 1, 6, 11, 16, 21, 19, 24, 29, 34, 39, 37, 42, 47, 52, 57, 55, 60, 65, 63, 68, 66, 71, 76, 74, 79, 84, 89, 94, 92, 97, 102, 107, 112, 110, 115, 120, 118, 123, 121, 126, 131, 129, 134, 139, 144, 149, 147, 152, 157, 162, 167, 165, 170, 175, 173, 178, 176
(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
|
Perhaps this is asymptotic to c_0*n*(1 + c_1/log n + ...), with c_0 near 2 ?
|
|
CROSSREFS
|
Cf. A080912, A080913, A080904, A080914, A080578, A080919, A080922, A080927.
Cf. A080901 (starting value = 2).
Sequence in context: A070397 A080904 A081746 this_sequence A080783 A016861 A140232
Adjacent sequences: A080897 A080898 A080899 this_sequence A080901 A080902 A080903
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas and Benoit Cloitre, Apr 01 2003
|
|
|
Search completed in 0.002 seconds
|
