

A049337


Triangle read by rows: T(n,k) = number of 3connected planar graphs (or polyhedra) with n >= 1 nodes and 0<=k<=C(n,2) edges.


7



0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 8, 11, 8, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 11, 42, 74, 76, 38, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 74, 296, 633, 768, 558, 219
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,32


LINKS

Table of n, a(n) for n=1..90.


EXAMPLE

0; 0,0; 0,0,0,0; 0,0,0,1,0,0,0; 0,0,0,0,0,1,1,0,0,0; 0,0,0,0,0,0,1,2,2,...


CROSSREFS

Cf. A000944, A021103, A003094, A049334.
A049337, A058787, A212438 are all versions of the same triangle.
Sequence in context: A006831 A016414 A049801 * A076953 A180472 A093315
Adjacent sequences: A049334 A049335 A049336 * A049338 A049339 A049340


KEYWORD

nonn,tabf,easy,nice


AUTHOR

Brendan McKay


STATUS

approved



