Triangle read by rows: T(n,k) is the number of simple graphs on n labeled vertices with k edges and without endpoints, n >= 0, 0 <= k <= n*(n-1)/2.
A369928
Triangle read by rows: T(n,k) is the number of simple graphs on n labeled vertices with k edges and without endpoints, n >= 0, 0 <= k <= n*(n-1)/2.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =0a(4) =1a(5) =0a(6) =0a(7) =1a(8) =1a(9) =0a(10) =0a(11) =4a(12) =3a(13) =6a(14) =1a(15) =1a(16) =0a(17) =0a(18) =10a(19) =15a(20) =42a(21) =90a(22) =100a(23) =45a(24) =10a(25) =1a(26) =1a(27) =0a(28) =0a(29) =20
External references
- oeis: A369928