Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006825
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006825 Number of connected regular bipartite graphs of degree 5 with 2n nodes.
(Formerly M3679)
+0
3
1, 1, 4, 41, 1981, 304495, 78322915 (list; graph; listen)
OFFSET

5,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

CRC Handbook of Combinatorial Designs, 1996, p. 648.

I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Probl\`{e}mes combinatoires et th\'{e}orie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.

LINKS

M. Meringer, Tables of Regular Graphs

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

CROSSREFS

Cf. A006823, A006824.

A column of triangle A008326.

Sequence in context: A006129 A022515 A059730 this_sequence A022500 A076652 A078288

Adjacent sequences: A006822 A006823 A006824 this_sequence A006826 A006827 A006828

KEYWORD

nonn,hard

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Eric Rogoyski May 15 1997

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research