|
Search: id:A061891
|
|
|
| A061891 |
|
a(0)=1; for n>0, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+3 otherwise. |
|
+0
1
|
|
| 1, 1, 4, 7, 7, 10, 13, 13, 16, 19, 19, 22, 25, 25, 28, 31, 31, 34, 37, 37, 40, 43, 43, 46, 49, 49, 52, 55, 55, 58, 61, 61, 64, 67, 67, 70, 73, 73, 76, 79, 79, 82, 85, 85, 88, 91, 91, 94, 97, 97, 100, 103, 103, 106, 109, 109, 112, 115, 115, 118, 121, 121, 124
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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
|
a(n) = 2n-1 if n==1 (mod 3), 2n if n == 2 (mod 3), 2n+1 if n == 0 (mod 3).
Differences are periodic with period 3.
a(n)=sum{k=0..n}{(1/3)*(2*(n mod 3)-((n+1) mod 3)+5*((n+2) mod 3))}-2 - Paolo P. Lava (ppl(AT)spl.at), Jun 25 2007
|
|
CROSSREFS
|
Cf. A080578.
Sequence in context: A159919 A131432 A088744 this_sequence A063194 A071529 A154922
Adjacent sequences: A061888 A061889 A061890 this_sequence A061892 A061893 A061894
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com) and Benoit Cloitre, Apr 01 2003
|
|
|
Search completed in 0.002 seconds
|
