Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137383
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137383 Total number of different ways to fill m labelled boxes with balls which belong to the specifications provided by all the integer partitions [n] of n. Empty boxes are not allowed. Total number of possible preferential arrangements (or hierarchical orderings) of n elements if the elements may belong to c=1 up to c=n different classes (or specifications). +0
2
1, 5, 25, 173, 20335, 45999 (list; graph; listen)
OFFSET

1,2

REFERENCES

John Riordan: Introduction to combinatorics New York, unabridged republication of the edition published by John Wiley & Sons, New York, 1958, ISBN 0-486-42536-3.

Percy A. MacMahon: Combinatorial Analysis, Volumes I, II bound in one volume, Chelsea Publishing Company, New York, 1960, Reprint of the two volumes published 1915, 1916 by Cambridge University Press, Library of Congress Catalog Card No. 59-10267.

LINKS

Thomas Wieder, Home Page.

Thomas Wieder, (Old) Home Page.

CROSSREFS

Cf. A000079, A000670.

Sequence in context: A109793 A112242 A035341 this_sequence A049035 A047897 A121144

Adjacent sequences: A137380 A137381 A137382 this_sequence A137384 A137385 A137386

KEYWORD

nonn

AUTHOR

Thomas Wieder (thomas.wieder(AT)t-online.de), Apr 09 2008

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research