Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth at least g.

A185340

Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth at least g.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =6a(4) =1a(5) =16a(6) =0a(7) =60a(8) =2a(9) =266a(10) =2a(11) =1547a(12) =12a(13) =10786a(14) =31a(15) =88193a(16) =220a(17) =805579a(18) =1606a(19) =8037796a(20) =16829a(21) =86223660a(22) =193900a(23) =985883873a(24) =2452820a(25) =11946592242a(26) =32670332a(27) =1a(28) =152808993767a(29) =456028489

External references