3,2

Number of n-node (unlabeled) connected graphs with girth k:

.k..|.n=........3........4........5........6........7........8........9........10

---------------------------------------------------------------------------------

.0..|...........0........0........0........0........0........0........0.........0

.1..|...........0........0........0........0........0........0........0.........0

.2..|...........0........0........0........0........0........0........0.........0

.3..|...........1........3.......15.......93......793....10850...259689..11706695

.4..|...........0........1........2.......11.......42......220.....1254......9412

.5..|...........0........0........1........1........5.......16.......67.......271

.6..|...........0........0........0........1........1........6.......16........64

.7..|...........0........0........0........0........1........1........5........15

.8..|...........0........0........0........0........0........1........1.........6

.9..|...........0........0........0........0........0........0........1.........1

10..|...........0........0........0........0........0........0........0.........1

11..|...........0........0........0........0........0........0........0.........0

Cf. A128041, A006787, A128236-A128243.

Sequence in context: A101820 A055301 A080924 this_sequence A108083 A134145 A134146

Adjacent sequences: A128039 A128040 A128041 this_sequence A128043 A128044 A128045

nonn

Keith M. Briggs, May 05 2007