%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.
%A _Brendan McKay_