cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A055389 a(0) = 1, then twice the Fibonacci sequence.

Original entry on oeis.org

1, 2, 2, 4, 6, 10, 16, 26, 42, 68, 110, 178, 288, 466, 754, 1220, 1974, 3194, 5168, 8362, 13530, 21892, 35422, 57314, 92736, 150050, 242786, 392836, 635622, 1028458, 1664080, 2692538, 4356618, 7049156, 11405774, 18454930, 29860704, 48315634, 78176338
Offset: 0

Views

Author

Robert G. Wilson v, Jul 05 2000

Keywords

Comments

a(n) is the number of sequences over the alphabet {0,1} such that all maximal blocks (of both 0's and 1's) have odd length. E.g., a(4) = 6 because we have 0001, 0101, 0111, 1000, 1010, 1110. - Geoffrey Critzer, Mar 06 2012

Crossrefs

Essentially the same as A006355.
Cf. A000045.

Programs

Formula

G.f.: (1 + x - x^2)/(1 - x - x^2).
E.g.f.: 1 + 4*exp(x/2)*sinh(sqrt(5)*x/2)/sqrt(5). - Stefano Spezia, Apr 18 2022

Extensions

More terms from James Sellers, Jul 07 2000