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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053526 Number of bipartite graphs with 3 edges on nodes {1..n}. 3
0, 0, 0, 0, 16, 110, 435, 1295, 3220, 7056, 14070, 26070, 45540, 75790, 121121, 187005, 280280, 409360, 584460, 817836, 1124040, 1520190, 2026255, 2665355, 3464076, 4452800, 5666050, 7142850, 8927100, 11067966, 13620285 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

REFERENCES

R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.5.

FORMULA

(n-3)(n-2)(n-1)n(n^2+3n+4)/48.

CROSSREFS

Cf. A000217 (1 edge), A050534 (2 edges).

Sequence in context: A165558 A155871 A120668 * A107908 A177046 A144449

Adjacent sequences:  A053523 A053524 A053525 * A053527 A053528 A053529

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 16 2000

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:07 EST 2012. Contains 205852 sequences.