Triangle read by rows: T(n,k) is the number of simple regular connected bipartite graphs with 2n nodes and degree k, (2 <= k <= n).
A008326
Triangle read by rows: T(n,k) is the number of simple regular connected bipartite graphs with 2n nodes and degree k, (2 <= k <= n).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =1a(9) =1a(10) =1a(11) =5a(12) =4a(13) =1a(14) =1a(15) =1a(16) =13a(17) =14a(18) =4a(19) =1a(20) =1a(21) =1a(22) =38a(23) =129a(24) =41a(25) =7a(26) =1a(27) =1a(28) =1a(29) =149
External references
- oeis: A008326