|
|
A006927
|
|
Number of connected trivalent graphs with 2n nodes and girth exactly 7.
(Formerly M3086)
|
|
13
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 21, 545, 30368, 1782839, 95079080, 4686063107
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,14
|
|
REFERENCES
|
Gordon Royle, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Definition amended to include "connected" (no disconnected yet), and "girth at least 7" minus "girth at least 8" formula provided by Jason Kimberley, Dec 12 2009
|
|
STATUS
|
approved
|
|
|
|