3,2

Number of n-node (unlabeled) graphs with girth k, for n >= 3, k >= 3.

.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........4.......20......118......936....11935...272757..11992940

.4..|...........0........1........3.......15.......60......297.....1618.....11359

.5..|...........0........0........1........2........8.......26......102.......402

.6..|...........0........0........0........1........2........9.......27.......101

.7..|...........0........0........0........0........1........2........8........25

.8..|...........0........0........0........0........0........1........2.........9

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

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

Cf. A128042, A006787, A128236-A128243.

Sequence in context: A057968 A141233 A055139 this_sequence A144885 A144886 A117380

Adjacent sequences: A128038 A128039 A128040 this_sequence A128042 A128043 A128044

nonn,tabl

Keith M. Briggs, May 05 2007