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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176725 Number of ways to choose one element from the multiset corresponding to the k-th multiset repetition class defining partition of n in canonical Abramowitz-Stegun order. 8
0, 1, 1, 2, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 2, 2, 1, 3, 2, 2, 1, 3, 3, 2, 2, 2, 1, 4, 3, 3, 2, 2, 2, 1, 4, 3, 3, 2, 2, 2, 1, 4, 3, 3, 3, 2, 3, 2, 2, 2, 1, 4, 4, 3, 3, 3, 2, 3, 2, 2, 2, 1, 4, 4, 3, 3, 3, 2, 3, 2, 2, 2, 1, 5, 4, 3, 4, 3, 3, 3, 2, 3, 2, 3, 2, 2, 2, 1, 5, 4, 4, 4, 3, 4, 3, 3, 3, 2, 3, 2, 3, 2, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

This array a(n,k), called (Multiset choose 1), is also denoted by MS(1;n,k).

MS(1;n,k) gives the number of ways to choose one element from the multiset encoded by the k-th multiset repetition class defining partition of n. a(n,k)=MS(1;n,k) is the largest part in the k-th multiset defining partition of n, i.e., the largest element in the multiset. The A-St order for partitions is used. For n=0 the empty multiset appears.

The row lengths of this array are A007294(n).

Multisets are sets in which the elements are allowed to appear more than once. Representatives of repetition classes can be characterized as certain partitions of the non-negative integers n. For the characteristic array of these partitions of n in A-St order see A176723.

This is the first member of an l-family of arrays for multiset choose l, called MS(l;n,k). This investigation was stimulated by the quoted Griffiths and Mezo (written with hungarian \H o) paper.

LINKS

Table of n, a(n) for n=0..104.

M. Griffiths and I. Mezo, A Generalization of Stirling Numbers of the Second Kind via a Special Multiset, Journal of Integer Sequences 13 (2010) 10.2.5.

W. Lang, First 15 rows and corresponding multisets.

FORMULA

a(n,k)= largest part in the k-th multiset repetition class defining partition of n>=1. a(0,1):=0. See the characteristic array A176723 in order to find this partition.

a(n,k) = largest element of the k-th multiset repetition class representative in row n>=1, a(0,1):=0.

EXAMPLE

[0],

[1],

[1],

[2,1],

[2,1],

[2,1],

[3,2,2,1],

[3,2,2,1],

[3,2,2,1],

[3,3,2,2,2,1],

...

a(6,2)=MS(1;6,2)=2 because the second multiset repetition class defining partition of n=6 is [1^2,2^2] (from the characteristic array A176723) encoding the 4-multiset representative {1,1,2,2}, and there are 2 ways to choose 1 element from this set.

CROSSREFS

Sequence in context: A167970 A126433 A237271 * A085029 A185318 A008622

Adjacent sequences:  A176722 A176723 A176724 * A176726 A176727 A176728

KEYWORD

nonn,tabf,easy

AUTHOR

Wolfdieter Lang, Jul 14 2010

EXTENSIONS

Changed in response to comments by Franklin T. Adams-Watters - Wolfdieter Lang, Apr 02 2011.

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 23 07:56 EST 2014. Contains 249839 sequences.