|
|
A007102
|
|
Number of labeled disconnected trivalent (or cubic) graphs with 2n nodes.
(Formerly M5251)
|
|
1
|
|
|
1, 0, 0, 0, 35, 14700, 11832975, 15245900670, 29683109280825, 84114515340655800, 335974271076054435825, 1839316574841276904122750, 13461678841737111645720135075, 128798406388658994689642297857500
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
REFERENCES
|
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|