login
The OEIS is supported by the many generous donors 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 (?). 1
1, 2, 4, 10, 24, 68, 198, 656, 2112 (list; graph; refs; listen; history; text; 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).
FORMULA
Calculated using Cor. 6.3.3, Th. 6.3.6, Cor. 6.2.5 of Brualdi-Ryser.
CROSSREFS
A possible duplicate of A028506.
Sequence in context: A309504 A148088 A028506 * A148089 A363065 A200743
KEYWORD
nonn,more,obsc,changed
AUTHOR
torsten.sillke(AT)lhsystems.com
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:23 EDT 2024. Contains 371970 sequences. (Running on oeis4.)