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.

A069907 Number of hexagons that can be formed with perimeter n. In other words, partitions of n into six parts such that the sum of any 5 is more than the sixth.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 6, 9, 12, 16, 22, 28, 37, 46, 59, 71, 91, 107, 134, 157, 193, 222, 271, 308, 371, 419, 499, 559, 661, 734, 860, 952, 1106, 1216, 1405, 1537, 1764, 1923, 2193, 2381, 2703, 2923, 3301, 3561, 4002, 4302, 4817, 5164
Offset: 0

Views

Author

N. J. A. Sloane, May 05 2002

Keywords

Crossrefs

Number of k-gons that can be formed with perimeter n: A005044 (k=3), A062890 (k=4), A069906 (k=5), this sequence (k=6), A288253 (k=7), A288254 (k=8), A288255 (k=9), A288256 (k=10).

Programs

  • PARI
    concat(vector(6), Vec(x^6*(1-x^4+x^5+x^7-x^8-x^13)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^6)*(1-x^8)*(1-x^10)) + O(x^80))) \\ Michel Marcus, Jun 24 2017

Formula

G.f.: x^6*(1-x^4+x^5+x^7-x^8-x^13)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^6)*(1-x^8)*(1-x^10)).
a(2*n+10) = A026812(2*n+10) - A002622(n), a(2*n+11) = A026812(2*n+11) - A002622(n) for n >= 0. - Seiichi Manyama, Jun 08 2017