Triangle read by rows: T(n,k) is the number of connected graphs with n nodes and degeneracy k, 0 <= k < n.

A352067

Triangle read by rows: T(n,k) is the number of connected graphs with n nodes and degeneracy k, 0 <= k < n.

Terms

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

External references