Regular triangle read by rows where T(n,k) is the number of labeled connected graphs with loops with n edges and k vertices, 1 <= k <= n+1.
A322147
Regular triangle read by rows where T(n,k) is the number of labeled connected graphs with loops with n edges and k vertices, 1 <= k <= n+1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =0a(4) =2a(5) =3a(6) =0a(7) =1a(8) =10a(9) =16a(10) =0a(11) =0a(12) =12a(13) =79a(14) =125a(15) =0a(16) =0a(17) =6a(18) =162a(19) =847a(20) =1296a(21) =0a(22) =0a(23) =1a(24) =179a(25) =2565a(26) =11436a(27) =16807a(28) =0a(29) =0
External references
- oeis: A322147