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
%I A006714 M4757
%S A006714 10,840,257040,137260200,118257539400,154678050727200
%N A006714 Number of trivalent bipartite labeled graphs with 2n nodes.
%D A006714 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006714 R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, 
               Department of Mathematics, Univ. London, 1958.
%Y A006714 Sequence in context: A013434 A013436 A013437 this_sequence A015033 A126677 
               A054328
%Y A006714 Adjacent sequences: A006711 A006712 A006713 this_sequence A006715 A006716 
               A006717
%K A006714 nonn
%O A006714 3,1
%A A006714 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research