|
Search: id:A103921
|
|
|
| A103921 |
|
Table of number of distinct parts of partitions of n in Abramowitz-Stegun order. |
|
+0
5
|
|
| 0, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 3, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 2, 3, 3, 2, 2, 2, 3, 2, 3, 1, 2, 3, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 3, 1, 2, 3, 3, 3, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 2, 3
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
The row length sequence of this table is p(n)=A000041(n) (number of partitions).
In order to count distinct parts of a partition consider the partition as a set instead of a multiset. E.g. n=6: read [1,1,1,3] as {1,3} and count the number of elements, here 2.
Rows are the same as the rows of A115623, but in reverse order.
|
|
LINKS
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, December 1972, pp. 831-2.
W. Lang: Fir st 10 rows.
|
|
FORMULA
|
a(n, m)=number of distinct parts of the m-th partition of n in Abramowitz-Stegun order; n>=0, m=1..p(n)=A000041(n).
|
|
EXAMPLE
|
0; 1; 1,1; 1,2,1; 1,2,1,2,1; 1,2,2,2,2,2,1; ...
a(5,4)=2 from the fourth partition of 5 in the mentioned order, i.e. (1^2,3), which has two distinct parts, namely 1 and 3.
|
|
CROSSREFS
|
Cf. A036036, A000041, A115623, A115621, row sums A000070.
Sequence in context: A003842 A095771 A007421 this_sequence A115623 A134265 A001030
Adjacent sequences: A103918 A103919 A103920 this_sequence A103922 A103923 A103924
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Mar 24 2005
|
|
EXTENSIONS
|
Edited by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), May 29 2006
|
|
|
Search completed in 0.002 seconds
|
