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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029893 Number of graphical partitions with up to n parts (?). 0
1, 2, 4, 10, 24, 68, 198, 656, 2112 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

R. A. Brualdi, H. J. Ryser, Combinatorial Matrix Theory, Cambridge Univ. Press, 1992.

LINKS

T. M. Barnes and C. D. Savage, A recurrence for counting graphical partitions, Electronic J. Combinatorics, 2 (1995)

Index entries for sequences related to graphical partitions

FORMULA

Calculated using Cor. 6.3.3, Th. 6.3.6, Cor. 6.2.5 of Brualdi-Ryser.

CROSSREFS

Cf. A000569, A004250, A004251, A029889.

Sequence in context: A121186 A028506 A148088 * A148089 A200743 A060776

Adjacent sequences:  A029890 A029891 A029892 * A029894 A029895 A029896

KEYWORD

nonn

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.COM

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 16 17:48 EST 2012. Contains 205939 sequences.