Number of connected trivalent graphs with 2n nodes and girth exactly 5.

A006925

Number of connected trivalent graphs with 2n nodes and girth exactly 5.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =2a(7) =8a(8) =48a(9) =450a(10) =5751a(11) =90553a(12) =1612905a(13) =31297357a(14) =652159389a(15) =14499780660a(16) =342646718608

External references