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