The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049337 Triangle read by rows: T(n,k) = number of 3-connected planar graphs (or polyhedra) with n >= 1 nodes and 0<=k<=C(n,2) edges. 7

%I

%S 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,

%T 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,

%U 76,38,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,74,296,633,768,558,219

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

%e 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,...

%Y Cf. A000944, A021103, A003094, A049334.

%Y A049337, A058787, A212438 are all versions of the same triangle.

%K nonn,tabf,easy,nice

%O 1,32

%A _Brendan McKay_

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

Last modified January 24 01:05 EST 2020. Contains 331178 sequences. (Running on oeis4.)