Triangular array E(n,k) counting not necessarily connected k-regular simple graphs on n vertices with girth at least 5.
A185305
Triangular array E(n,k) counting not necessarily connected k-regular simple graphs on n vertices with girth at least 5.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =0a(5) =1a(6) =1a(7) =1a(8) =0a(9) =1a(10) =1a(11) =1a(12) =1a(13) =1a(14) =0a(15) =1a(16) =1a(17) =1a(18) =1a(19) =1a(20) =0a(21) =1a(22) =1a(23) =1a(24) =2a(25) =1a(26) =1a(27) =0a(28) =2a(29) =0
External references
- oeis: A185305