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.

A228361 The number of all possible covers of L-length line segment by 2-length line segments with allowed gaps < 2.

Original entry on oeis.org

0, 0, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, 351, 465, 616, 816, 1081, 1432, 1897, 2513, 3329, 4410, 5842, 7739, 10252, 13581, 17991, 23833, 31572, 41824, 55405, 73396, 97229, 128801, 170625, 226030, 299426, 396655, 525456
Offset: 0

Views

Author

Philipp O. Tsvetkov, Aug 21 2013

Keywords

Crossrefs

Second row of A228360.
The following are basically all variants of the same sequence: A000931, A078027, A096231, A124745, A133034, A134816, A164001, A182097, A228361 and probably A020720. However, each one has its own special features and deserves its own entry.

Programs

  • Mathematica
    CoefficientList[Series[(1 - x^2 - x^3)^-1 (1 + x)^2 x^2 , {x, 0, 100}], x]

Formula

For n>1, a(n) = A134816(n).
G.f.: x^2*(1+x)^2/(1-x^2-x^3).
a(n) = a(n-2) +a(n-3) for n >= 5.
a(n) = A000931(n+5), n>1. - R. J. Mathar, Sep 02 2013