|
Search: id:A069907
|
|
|
| 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. |
|
+0
6
|
|
| 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; listen)
|
|
|
OFFSET
|
0,9
|
|
|
REFERENCES
|
G. E. Andrews, P. Paule and A. Riese, MacMahon's Partition Analysis IX: k-gon partitions, Bull. Austral Math. Soc., 64 (2001), 321-329.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..1000
G. E. Andrews, P. Paule and A. Riese, MacMahon's partition analysis III. The Omega package, p. 19.
|
|
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)).
|
|
CROSSREFS
|
Cf. A005044, A062890, A069906.
Sequence in context: A155510 A058647 A073576 this_sequence A001935 A083365 A007604
Adjacent sequences: A069904 A069905 A069906 this_sequence A069908 A069909 A069910
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 05, 2002
|
|
|
Search completed in 0.002 seconds
|
