|
|
A335784
|
|
Irregular table read by rows: n-sect the angles of a nonagon (enneagon). Then T(n,k) = number of k-sided polygons in that figure for k >= 3.
|
|
4
|
|
|
0, 0, 0, 0, 0, 0, 1, 18, 36, 81, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 126, 36, 180, 135, 18, 45, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 288, 126, 54, 90, 36, 18, 9, 0, 0, 1, 450, 306, 72, 18, 576, 369, 207, 126, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
For n<=200 no polygon has more than 18 edges.
|
|
LINKS
|
|
|
EXAMPLE
|
The table begins:
0, 0, 0, 0, 0, 0, 1;
18;
36, 81, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
126, 36;
180, 135, 18, 45, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
288, 126, 54;
90, 36, 18, 9, 0, 0, 1;
450, 306, 72, 18;
576, 369, 207, 126, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
|
|
CROSSREFS
|
|
|
KEYWORD
|
tabf,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|