login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 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; refs; listen; history; text; internal format)
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: A187020 A058647 A271147 * A280424 A083365 A001935

Adjacent sequences:  A069904 A069905 A069906 * A069908 A069909 A069910

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 05, 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified April 25 00:46 EDT 2017. Contains 285346 sequences.