Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with k simplical vertices, 0 <= k <= n.
A367145
Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with k simplical vertices, 0 <= k <= n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =2a(6) =0a(7) =0a(8) =1a(9) =3a(10) =1a(11) =0a(12) =2a(13) =3a(14) =5a(15) =4a(16) =3a(17) =4a(18) =8a(19) =8a(20) =7a(21) =24a(22) =24a(23) =25a(24) =26a(25) =29a(26) =17a(27) =11a(28) =191a(29) =239
External references
- oeis: A367145