Triangle read by rows: T(n,k) is the number of planar graphs with n >= 1 nodes and 0 <= k <= binomial(n,2) edges, all degrees even.

A049340

Triangle read by rows: T(n,k) is the number of planar graphs with n >= 1 nodes and 0 <= k <= binomial(n,2) edges, all degrees even.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =0a(6) =1a(7) =1a(8) =0a(9) =0a(10) =1a(11) =1a(12) =0a(13) =0a(14) =1a(15) =0a(16) =0a(17) =1a(18) =1a(19) =1a(20) =1a(21) =1a(22) =0a(23) =0a(24) =0a(25) =1a(26) =0a(27) =0a(28) =1a(29) =1

External references