Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth at least g.
A184941
Irregular triangle C(n,g) counting the 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) =59a(8) =2a(9) =265a(10) =2a(11) =1544a(12) =12a(13) =10778a(14) =31a(15) =88168a(16) =220a(17) =805491a(18) =1606a(19) =8037418a(20) =16828a(21) =86221634a(22) =193900a(23) =985870522a(24) =2452818a(25) =11946487647a(26) =32670330a(27) =1a(28) =152808063181a(29) =456028474
External references
- oeis: A184941