Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A029893
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A029893 Number of graphical partitions with up to n parts (?). +0
1
1, 2, 4, 10, 24, 68, 198, 656, 2112 (list; graph; listen)
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 this_sequence A148089 A060776 A061055

Adjacent sequences: A029890 A029891 A029892 this_sequence A029894 A029895 A029896

KEYWORD

nonn

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research