|
|
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.
|
|
10
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,9
|
|
LINKS
|
Index entries for linear recurrences with constant coefficients, signature (0, 1, 1, 1, -1, 0, -1, 0, 0, -1, 0, -1, 1, -1, 1, 1, 1, 1, -1, 1, -1, 0, -1, 0, 0, -1, 0, -1, 1, 1, 1, 0, -1).
|
|
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)).
|
|
PROG
|
(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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|