Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes whose maximal connected component has at most k nodes, n>=1, 1<=k<=n.
A275364
Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes whose maximal connected component has at most k nodes, n>=1, 1<=k<=n.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =8a(6) =1a(7) =10a(8) =26a(9) =64a(10) =1a(11) =26a(12) =106a(13) =296a(14) =1024a(15) =1a(16) =76a(17) =556a(18) =1696a(19) =6064a(20) =32768a(21) =1a(22) =232a(23) =2752a(24) =13392a(25) =43968a(26) =230896a(27) =2097152a(28) =1a(29) =764
External references
- oeis: A275364