|
| |
|
|
A330914
|
|
Irregular table read by rows: Take a semicircular polygon with all vertices mutually connected by straight line segments, as in A333642. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.
|
|
3
|
|
|
|
2, 7, 1, 16, 4, 30, 10, 3, 52, 20, 8, 79, 47, 10, 3, 116, 86, 18, 4, 168, 145, 9, 2, 234, 212, 52, 12, 319, 312, 80, 17, 2, 430, 446, 96, 18, 2, 551, 616, 173, 28, 5, 730, 792, 248, 44, 6, 960, 1035, 167, 25, 1148, 1384, 422, 66, 20
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
See A333642 for a precise definition of the polygon and images.
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Table begins:
2;
7,1;
16,4;
30,10,3;
52,20,8;
79,47,10,3;
116,86,18,4;
168,145,9,2;
234,212,52,12;
319,312,80,17,2;
430,446,96,18,2;
551,616,173,28,5;
730,792,248,44,6;
960,1035,167,25;
1148,1384,422,66,20;
1427,1745,552,108,12;
1784,2154,648,120,14;
2179,2618,927,164,27,1
2652,3200,1088,244,36;
3237,3842,1170,218,26,3,2;
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more,tabf
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
