Triangle T(n,k) read by rows, giving number of graphs with n nodes (n >= 1) and k edges (0 <= k <= n(n-1)/2).

A008406

Triangle T(n,k) read by rows, giving number of graphs with n nodes (n >= 1) and k edges (0 <= k <= n(n-1)/2).

Terms

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

External references