Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006714
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006714 Number of trivalent bipartite labeled graphs with 2n nodes.
(Formerly M4757)
+0
1
10, 840, 257040, 137260200, 118257539400, 154678050727200 (list; graph; listen)
OFFSET

3,1

REFERENCES

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

R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.

CROSSREFS

Sequence in context: A013434 A013436 A013437 this_sequence A015033 A126677 A054328

Adjacent sequences: A006711 A006712 A006713 this_sequence A006715 A006716 A006717

KEYWORD

nonn

AUTHOR

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

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research