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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137383 Total number of different ways to fill m labeled 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). 1
1, 5, 25, 173, 20335, 45999 (list; graph; refs; listen; history; text; internal format)
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

Table of n, a(n) for n=1..6.

CROSSREFS

Cf. A000079, A000670.

Sequence in context: A112242 A035341 A258369 * A049035 A047897 A204461

Adjacent sequences:  A137380 A137381 A137382 * A137384 A137385 A137386

KEYWORD

nonn

AUTHOR

Thomas Wieder, Apr 09 2008

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 17:38 EDT 2019. Contains 325198 sequences. (Running on oeis4.)