|
Search: id:A138587
|
|
| |
|
| 0, 1, 2, 3, 5, 6, 10, 11, 21, 22, 42, 43, 85, 86, 170, 171, 341, 342, 682, 683, 1365, 1366, 2730, 2731, 5461, 5462, 10922, 10923, 21845, 21846, 43690, 43691, 87381, 87382, 174762, 174763, 349525, 349526, 699050, 699051, 1398101, 1398102, 2796202, 2796203, 5592405
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The three sequences of the definition share the same special recurrence which reflects that each equals its own sequence of third differences.
|
|
FORMULA
|
a(n+8) == a(n) (mod 10), n > 1.
a(2*n+1)-a(2*n)=1.
a(2*n) = A000975(n+1), n>0 (bisection).
a(n)= -a(n-1) +a(n-2) +a(n-3) +2*a(n-4) +2*a(n-5), n>6. G.f.: x*(3*x+4*x^2+5*x^3+4*x^4+2*x^5+1)/((1+x)*(1-2*x^2)*(1+x^2)). [R. J. Mathar, Nov 22 2009]
|
|
CROSSREFS
|
Adjacent sequences: A138584 A138585 A138586 this_sequence A138588 A138589 A138590
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Paul Curtz (bpcrtz(AT)free.fr), May 13 2008
|
|
EXTENSIONS
|
Edited and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 22 2009
|
|
|
Search completed in 0.002 seconds
|
