The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Table of n, a(n) for n=5..20. M. Meringer, Tables of Regular Graphs B. D. McKay and E. Rogoyski, Latin squares of order ten, Electron. J. Combinatorics, 2 (1995) #N3. FORMULA Inverse Euler transform of A333731. - Andrew Howroyd, Apr 03 2020 CROSSREFS Column 5 of A008326. Cf. A006823, A006824, A333731. Sequence in context: A022515 A172496 A059730 * A333731 A326899 A022500 Adjacent sequences: A006822 A006823 A006824 * A006826 A006827 A006828 KEYWORD nonn,hard AUTHOR N. J. A. Sloane EXTENSIONS More terms from Eric Rogoyski, May 15 1997 Terms a(12) and beyond from Andrew Howroyd, Apr 03 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 20 05:30 EDT 2024. Contains 374441 sequences. (Running on oeis4.)