|
|
A006825
|
|
Number of connected regular bipartite graphs of degree 5 with 2n nodes.
(Formerly M3679)
|
|
3
|
|
|
1, 1, 4, 41, 1981, 304495, 78322915, 27033154060, 11934777413004, 6593485023087880, 4485517185017428244, 3707462300996566329965, 3680029088808677189795063, 4341813441626419937873317841, 6033239205199247162872884404386, 9792722283774374706204648839780148
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
5,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
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Eric Rogoyski, May 15 1997
|
|
STATUS
|
approved
|
|
|
|