Irregular triangle read by rows where T(n,k) is the number of labeled connected loop-graphs covering n vertices with k edges.
A369195
Irregular triangle read by rows where T(n,k) is the number of labeled connected loop-graphs covering n vertices with k edges.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =1a(7) =0a(8) =0a(9) =3a(10) =10a(11) =12a(12) =6a(13) =1a(14) =0a(15) =0a(16) =0a(17) =16a(18) =79a(19) =162a(20) =179a(21) =116a(22) =45a(23) =10a(24) =1a(25) =0a(26) =0a(27) =0a(28) =0a(29) =125
External references
- oeis: A369195