Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth exactly g.
A184940
Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth exactly g.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =1a(5) =16a(6) =0a(7) =57a(8) =2a(9) =263a(10) =2a(11) =1532a(12) =12a(13) =10747a(14) =31a(15) =87948a(16) =220a(17) =803885a(18) =1606a(19) =8020590a(20) =16828a(21) =86027734a(22) =193900a(23) =983417704a(24) =2452818a(25) =11913817317a(26) =32670329a(27) =1a(28) =152352034707a(29) =456028472
External references
- oeis: A184940