|
|
A103609
|
|
Fibonacci numbers repeated (cf. A000045).
|
|
23
|
|
|
0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 5, 5, 8, 8, 13, 13, 21, 21, 34, 34, 55, 55, 89, 89, 144, 144, 233, 233, 377, 377, 610, 610, 987, 987, 1597, 1597, 2584, 2584, 4181, 4181, 6765, 6765, 10946, 10946, 17711, 17711, 28657, 28657, 46368, 46368, 75025, 75025, 121393
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
COMMENTS
|
The usual policy in the OEIS is not to include such "doubled" sequences. This is an exception. - N. J. A. Sloane
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-2) + a(n-4).
|
|
MAPLE
|
|
|
MATHEMATICA
|
a[0] = 0; a[1] = 0; a[2] = 1; a[3] = 1; a[n_Integer?Positive] := a[n] = a[n - 2] + a[n - 4]; aa = Table[a[n], {n, 0, 200}]
Join[{0, 0}, LinearRecurrence[{0, 1, 0, 1}, {1, 1, 1, 1}, 60]] (* Vincenzo Librandi, Jan 19 2016 *)
|
|
PROG
|
(PARI) x='x+O('x^50); Vec(x^2*(1+x)/(1-x^2-x^4)) \\ G. C. Greubel, May 01 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|