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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124278 Triangle of the number of nondegenerate k-gons having perimeter n and whose sides are nondecreasing, for k=3..n. 2
1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 3, 2, 2, 1, 1, 3, 4, 4, 3, 2, 1, 1, 2, 5, 5, 4, 3, 2, 1, 1, 4, 7, 8, 6, 5, 3, 2, 1, 1, 3, 8, 9, 9, 6, 5, 3, 2, 1, 1, 5, 11, 14, 12, 10, 7, 5, 3, 2, 1, 1, 4, 12, 16, 16, 13, 10, 7, 5, 3, 2, 1, 1, 7, 16, 23, 22, 19, 14, 11, 7, 5, 3, 2, 1, 1, 5, 18, 25, 28, 24 (list; table; graph; refs; listen; history; internal format)
OFFSET

3,11

COMMENTS

For a k-gon to be nondegenerate, the longest side must be shorter than the sum of the remaining sides. Column k=3 is A005044, column k=4 is A062890, column k=5 is A069906 and column k=6 is A069907.

LINKS

T. D. Noe, Rows n=3..102 of triangle, flattened

G. E. Andrews, P. Paule and A. Riese, MacMahon's Partition Analysis IX: k-Gon Partitions, Bull. Austral. Math. Soc. 64 (2001), 321-329.

FORMULA

G.f. for column k is x^k/(product_{i=1..k} 1-x^i) - x^(2k-2)/(1-x)/(product_{i=1..k-1} 1-x^(2i))

EXAMPLE

For polygons having perimeter 7: 2 triangles, 2 quadrilaterals, 2 pentagons, 1 hexagon and 1 heptagon. The triangle begins

1

0 1

1 1 1

1 1 1 1

2 2 2 1 1

1 3 2 2 1 1

MATHEMATICA

Flatten[Table[p=IntegerPartitions[n]; Length[Select[p, Length[ # ]==k && #[[1]] < Total[Rest[ # ]]&]], {n, 3, 30}, {k, 3, n}]]

CROSSREFS

Cf. A124287 (similar, but with no restriction on the sides).

Sequence in context: A135265 A144110 A076490 * A139755 A195052 A104637

Adjacent sequences:  A124275 A124276 A124277 * A124279 A124280 A124281

KEYWORD

nice,nonn,tabl

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Oct 24 2006

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:29 EST 2012. Contains 205694 sequences.