login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006824 Number of connected regular bipartite graphs of degree 4 with 2n nodes.
(Formerly M3493)
3
1, 1, 4, 14, 129, 1980, 62611, 2806490 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,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.

H. Gropp, On tactical configurations, regular bipartite graphs and (v,k,even)-designs, Discr. Math., 155 (1996), 81-98.

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=4..11.

B. D. McKay and E. Rogoyski, Latin squares of order ten, Electron. J. Combinatorics, 2 (1995) #N3.

M. Meringer, Tables of Regular Graphs

CROSSREFS

Cf. A006823, A006825.

A column of triangle A008326.

Sequence in context: A137048 A137056 A302021 * A254718 A162077 A247526

Adjacent sequences:  A006821 A006822 A006823 * A006825 A006826 A006827

KEYWORD

nonn,hard,more,nice

AUTHOR

N. J. A. Sloane

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 00:14 EST 2018. Contains 317275 sequences. (Running on oeis4.)