OFFSET
3,2
LINKS
Georg Grasegger, Table of n, a(n) for n = 3..122
EXAMPLE
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......794....10850...259700..11706739
.4..|...........0........1........2.......11.......41......220.....1243......9368
.5..|...........0........0........1........1........5.......16.......66.......266
.6..|...........0........0........0........1........1........6.......17........69
.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
PROG
(nauty) geng -c $n | countg --ng
# Martin Fuller, May 03 2015
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Keith Briggs, May 05 2007
EXTENSIONS
Corrected and extended by Martin Fuller, May 01 2015
STATUS
approved