|
|
A006823
|
|
Number of connected trivalent bipartite graphs with 2n nodes.
(Formerly M1450)
|
|
9
|
|
|
1, 1, 2, 5, 13, 38, 149, 703, 4132, 29579, 245627, 2291589, 23466857, 259974248, 3087698618, 39075020582, 524492748500, 7439833931266, 111179110620163, 1745593888011626, 28726140345832290, 494406533261250407, 8881990236308687928, 166255686198172837111, 3237191621055524796848, 65467841616499410561220
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,3
|
|
REFERENCES
|
CRC Handbook of Combinatorial Designs, 1996, p. 648.
I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Problèmes combinatoires et théorie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|