[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a336343 -id:a336343
     Sort: relevance | references | number | modified | created      Format: long | short | data
Triangle T(n,k) of number of compositions (ordered partitions) of n into exactly k distinct parts, 1<=k<=n.
+10
19
1, 1, 0, 1, 2, 0, 1, 2, 0, 0, 1, 4, 0, 0, 0, 1, 4, 6, 0, 0, 0, 1, 6, 6, 0, 0, 0, 0, 1, 6, 12, 0, 0, 0, 0, 0, 1, 8, 18, 0, 0, 0, 0, 0, 0, 1, 8, 24, 24, 0, 0, 0, 0, 0, 0, 1, 10, 30, 24, 0, 0, 0, 0, 0, 0, 0, 1, 10, 42, 48, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 48, 72, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 60, 120, 0
OFFSET
1,5
COMMENTS
If terms in the compositions did not need to be distinct then the triangle would have values C(n-1,k-1), essentially A007318 offset.
LINKS
Joerg Arndt, Table of n, a(n) for n = 1..5050 (rows 1..100, flattened).
B. Richmond and A. Knopfmacher, Compositions with distinct parts, Aequationes Mathematicae 49 (1995), pp. 86-97.
FORMULA
T(n, k) = T(n-k, k)+k*T(n-k, k-1) [with T(n, 0)=1 if n=0 and 0 otherwise] = A000142(k)*A060016(n, k).
G.f.: sum(n>=0, n! * z^n * q^((n^2+n)/2) / prod(k=1..n, 1-q^k ) ), rows by powers of q, columns by powers of z; includes row 0 (drop term for n=0 for this triangle, see PARI code); setting z=1 gives g.f. for A032020. [Joerg Arndt, Oct 20 2012]
EXAMPLE
T(6,2)=4 since 6 can be written as 1+5=2+4=4+2=5+1.
Triangle starts (trailing zeros omitted for n>=10):
[ 1] 1;
[ 2] 1, 0;
[ 3] 1, 2, 0;
[ 4] 1, 2, 0, 0;
[ 5] 1, 4, 0, 0, 0;
[ 6] 1, 4, 6, 0, 0, 0;
[ 7] 1, 6, 6, 0, 0, 0, 0;
[ 8] 1, 6, 12, 0, 0, 0, 0, 0;
[ 9] 1, 8, 18, 0, 0, 0, 0, 0, 0;
[10] 1, 8, 24, 24, 0, 0, ...;
[11] 1, 10, 30, 24, 0, 0, ...;
[12] 1, 10, 42, 48, 0, 0, ...;
[13] 1, 12, 48, 72, 0, 0, ...;
[14] 1, 12, 60, 120, 0, 0, ...;
[15] 1, 14, 72, 144, 120, 0, 0, ...;
[16] 1, 14, 84, 216, 120, 0, 0, ...;
[17] 1, 16, 96, 264, 240, 0, 0, ...;
[18] 1, 16, 114, 360, 360, 0, 0, ...;
[19] 1, 18, 126, 432, 600, 0, 0, ...;
[20] 1, 18, 144, 552, 840, 0, 0, ...;
These rows (without the zeros) are shown in the Richmond/Knopfmacher reference.
From Gus Wiseman, Oct 17 2022: (Start)
Column n = 8 counts the following compositions.
(8) (1,7) (1,2,5)
(2,6) (1,3,4)
(3,5) (1,4,3)
(5,3) (1,5,2)
(6,2) (2,1,5)
(7,1) (2,5,1)
(3,1,4)
(3,4,1)
(4,1,3)
(4,3,1)
(5,1,2)
(5,2,1)
(End)
MATHEMATICA
Table[Length[Select[Join@@Permutations/@Select[IntegerPartitions[n], UnsameQ@@#&], Length[#]==k&]], {n, 0, 15}, {k, 1, n}] (* Gus Wiseman, Oct 17 2022 *)
PROG
(PARI)
N=21; q='q+O('q^N);
gf=sum(n=0, N, n! * z^n * q^((n^2+n)/2) / prod(k=1, n, 1-q^k ) );
/* print triangle: */
gf -= 1; /* remove row zero */
P=Pol(gf, 'q);
{ for (n=1, N-1,
p = Pol(polcoeff(P, n), 'z);
p += 'z^(n+1); /* preserve trailing zeros */
v = Vec(polrecip(p));
v = vector(n, k, v[k]); /* trim to size n */
print(v);
); }
/* Joerg Arndt, Oct 20 2012 */
CROSSREFS
Columns (offset) include A057427 and A052928.
Row sums are A032020.
A008289 is the version for partitions (zeros removed).
A072575 counts strict compositions by maximum.
A097805 is the non-strict version, or A007318 (zeros removed).
A113704 is the constant instead of strict version.
A216652 is a condensed version (zeros removed).
A336131 counts splittings of partitions with distinct sums.
A336139 counts strict compositions of each part of a strict composition.
KEYWORD
nonn,tabl
AUTHOR
Henry Bottomley, Jun 21 2002
STATUS
approved
Number of ways to choose a partition of each part of a strict composition of n.
+10
15
1, 1, 2, 7, 11, 29, 81, 155, 312, 708, 1950, 3384, 7729, 14929, 32407, 81708, 151429, 305899, 623713, 1234736, 2463743, 6208978, 10732222, 22487671, 43000345, 86573952, 160595426, 324990308, 744946690, 1336552491, 2629260284, 5050032692, 9681365777
OFFSET
0,3
COMMENTS
A strict composition of n is a finite sequence of distinct positive integers summing to n.
Is there a simple generating function?
LINKS
FORMULA
G.f.: Sum_{k>=0} k! * [y^k](Product_{j>=1} 1 + y*x^j*A000041(j)). - Andrew Howroyd, Apr 16 2021
EXAMPLE
The a(1) = 1 through a(4) = 11 ways:
(1) (2) (3) (4)
(1,1) (2,1) (2,2)
(1,1,1) (3,1)
(1),(2) (1),(3)
(2),(1) (2,1,1)
(1),(1,1) (3),(1)
(1,1),(1) (1,1,1,1)
(1),(2,1)
(2,1),(1)
(1),(1,1,1)
(1,1,1),(1)
MATHEMATICA
Table[Length[Join@@Table[Tuples[IntegerPartitions/@ctn], {ctn, Join@@Permutations/@Select[IntegerPartitions[n], UnsameQ@@#&]}]], {n, 0, 10}]
PROG
(PARI) seq(n)={[subst(serlaplace(p), y, 1) | p<-Vec(prod(k=1, n, 1 + y*x^k*numbpart(k) + O(x*x^n)))]} \\ Andrew Howroyd, Apr 16 2021
CROSSREFS
Multiset partitions of partitions are A001970.
Strict compositions are counted by A032020, A072574, and A072575.
Splittings of partitions are A323583.
Splittings of partitions with distinct sums are A336131.
Partitions:
- Partitions of each part of a partition are A063834.
- Compositions of each part of a partition are A075900.
- Strict partitions of each part of a partition are A270995.
- Strict compositions of each part of a partition are A336141.
Strict partitions:
- Partitions of each part of a strict partition are A271619.
- Compositions of each part of a strict partition are A304961.
- Strict partitions of each part of a strict partition are A279785.
- Strict compositions of each part of a strict partition are A336142.
Compositions:
- Partitions of each part of a composition are A055887.
- Compositions of each part of a composition are A133494.
- Strict partitions of each part of a composition are A304969.
- Strict compositions of each part of a composition are A307068.
Strict compositions:
- Partitions of each part of a strict composition are A336342.
- Compositions of each part of a strict composition are A336127.
- Strict partitions of each part of a strict composition are A336343.
- Strict compositions of each part of a strict composition are A336139.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jul 18 2020
STATUS
approved
Number of ways to choose a strict composition of each part of an integer partition of n.
+10
6
1, 1, 2, 5, 9, 17, 41, 71, 138, 270, 518, 938, 1863, 3323, 6163, 11436, 20883, 37413, 69257, 122784, 221873, 397258, 708142, 1249955, 2236499, 3917628, 6909676, 12130972, 21251742, 36973609, 64788378, 112103360, 194628113, 336713377, 581527210, 1000153063
OFFSET
0,3
COMMENTS
A strict composition of n is a finite sequence of distinct positive integers summing to n.
LINKS
FORMULA
G.f.: Product_{k >= 1} 1/(1 - A032020(k)*x^k).
EXAMPLE
The a(1) = 1 through a(5) = 17 ways:
(1) (2) (3) (4) (5)
(1),(1) (1,2) (1,3) (1,4)
(2,1) (3,1) (2,3)
(2),(1) (2),(2) (3,2)
(1),(1),(1) (3),(1) (4,1)
(1,2),(1) (3),(2)
(2,1),(1) (4),(1)
(2),(1),(1) (1,2),(2)
(1),(1),(1),(1) (1,3),(1)
(2,1),(2)
(3,1),(1)
(2),(2),(1)
(3),(1),(1)
(1,2),(1),(1)
(2,1),(1),(1)
(2),(1),(1),(1)
(1),(1),(1),(1),(1)
MAPLE
b:= proc(n, i, p) option remember; `if`(i*(i+1)/2<n, 0,
`if`(n=0, p!, b(n, i-1, p)+b(n-i, min(n-i, i-1), p+1)))
end:
g:= proc(n, i) option remember; `if`(n=0 or i=1, 1,
g(n, i-1)+b(i$2, 0)*g(n-i, min(n-i, i)))
end:
a:= n-> g(n$2):
seq(a(n), n=0..38); # Alois P. Heinz, Jul 31 2020
MATHEMATICA
Table[Length[Join@@Table[Tuples[Join@@Permutations/@Select[IntegerPartitions[#], UnsameQ@@#&]&/@ctn], {ctn, IntegerPartitions[n]}]], {n, 0, 10}]
(* Second program: *)
b[n_, i_, p_] := b[n, i, p] = If[i(i+1)/2 < n, 0,
If[n==0, p!, b[n, i-1, p] + b[n-i, Min[n-i, i-1], p+1]]];
g[n_, i_] := g[n, i] = If[n==0 || i==1, 1, g[n, i-1] +
b[i, i, 0] g[n-i, Min[n-i, i]]];
a[n_] := g[n, n];
a /@ Range[0, 38] (* Jean-François Alcover, May 20 2021, after Alois P. Heinz *)
CROSSREFS
Multiset partitions of partitions are A001970.
Strict compositions are counted by A032020, A072574, and A072575.
Splittings of partitions are A323583.
Splittings of partitions with distinct sums are A336131.
Partitions:
- Partitions of each part of a partition are A063834.
- Compositions of each part of a partition are A075900.
- Strict partitions of each part of a partition are A270995.
- Strict compositions of each part of a partition are A336141.
Strict partitions:
- Partitions of each part of a strict partition are A271619.
- Compositions of each part of a strict partition are A304961.
- Strict partitions of each part of a strict partition are A279785.
- Strict compositions of each part of a strict partition are A336142.
Compositions:
- Partitions of each part of a composition are A055887.
- Compositions of each part of a composition are A133494.
- Strict partitions of each part of a composition are A304969.
- Strict compositions of each part of a composition are A307068.
Strict compositions:
- Partitions of each part of a strict composition are A336342.
- Compositions of each part of a strict composition are A336127.
- Strict partitions of each part of a strict composition are A336343.
- Strict compositions of each part of a strict composition are A336139.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jul 18 2020
STATUS
approved
Number of ways to choose a strict composition of each part of a strict integer partition of n.
+10
5
1, 1, 1, 4, 6, 11, 22, 41, 72, 142, 260, 454, 769, 1416, 2472, 4465, 7708, 13314, 23630, 40406, 68196, 119646, 203237, 343242, 586508, 993764, 1677187, 2824072, 4753066, 7934268, 13355658, 22229194, 36945828, 61555136, 102019156, 168474033, 279181966
OFFSET
0,4
COMMENTS
A strict composition of n is a finite sequence of distinct positive integers summing to n.
LINKS
FORMULA
G.f.: Product_{k >= 1} (1 + A032020(k)*x^k).
EXAMPLE
The a(1) = 1 through a(5) = 11 ways:
(1) (2) (3) (4) (5)
(1,2) (1,3) (1,4)
(2,1) (3,1) (2,3)
(2),(1) (3),(1) (3,2)
(1,2),(1) (4,1)
(2,1),(1) (3),(2)
(4),(1)
(1,2),(2)
(1,3),(1)
(2,1),(2)
(3,1),(1)
MAPLE
b:= proc(n, i, p) option remember; `if`(i*(i+1)/2<n, 0,
`if`(n=0, p!, b(n, i-1, p)+b(n-i, min(n-i, i-1), p+1)))
end:
g:= proc(n, i) option remember; `if`(i*(i+1)/2<n, 0,
`if`(n=0, 1, g(n, i-1)+b(i$2, 0)*g(n-i, min(n-i, i-1))))
end:
a:= n-> g(n$2):
seq(a(n), n=0..38); # Alois P. Heinz, Jul 31 2020
MATHEMATICA
strptn[n_]:=Select[IntegerPartitions[n], UnsameQ@@#&];
Table[Length[Join@@Table[Tuples[Join@@Permutations/@strptn[#]&/@ctn], {ctn, strptn[n]}]], {n, 0, 20}]
(* Second program: *)
b[n_, i_, p_] := b[n, i, p] = If[i(i+1)/2 < n, 0,
If[n == 0, p!, b[n, i-1, p] + b[n-i, Min[n-i, i-1], p+1]]];
g[n_, i_] := g[n, i] = If[i(i+1)/2 < n, 0,
If[n == 0, 1, g[n, i-1] + b[i, i, 0]*g[n-i, Min[n-i, i-1]]]];
a[n_] := g[n, n];
a /@ Range[0, 38] (* Jean-François Alcover, May 20 2021, after Alois P. Heinz *)
CROSSREFS
Multiset partitions of partitions are A001970.
Strict compositions are counted by A032020, A072574, and A072575.
Splittings of partitions are A323583.
Splittings of partitions with distinct sums are A336131.
Partitions:
- Partitions of each part of a partition are A063834.
- Compositions of each part of a partition are A075900.
- Strict partitions of each part of a partition are A270995.
- Strict compositions of each part of a partition are A336141.
Strict partitions:
- Partitions of each part of a strict partition are A271619.
- Compositions of each part of a strict partition are A304961.
- Strict partitions of each part of a strict partition are A279785.
- Strict compositions of each part of a strict partition are A336142.
Compositions:
- Partitions of each part of a composition are A055887.
- Compositions of each part of a composition are A133494.
- Strict partitions of each part of a composition are A304969.
- Strict compositions of each part of a composition are A307068.
Strict compositions:
- Partitions of each part of a strict composition are A336342.
- Compositions of each part of a strict composition are A336127.
- Strict partitions of each part of a strict composition are A336343.
- Strict compositions of each part of a strict composition are A336139.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jul 18 2020
STATUS
approved
Number of twice-partitions of n into distinct strict partitions.
+10
5
1, 1, 1, 3, 4, 7, 13, 20, 32, 51, 83, 130, 206, 320, 496, 759, 1171, 1786, 2714, 4104, 6193, 9286, 13920, 20737, 30865, 45721, 67632, 99683, 146604, 214865, 314782, 459136, 668867, 972425, 1410458, 2040894, 2950839, 4253713, 6123836, 8801349, 12627079
OFFSET
0,4
COMMENTS
A twice-partition of n (A063834) is a sequence of integer partitions, one of each part of an integer partition of n.
LINKS
EXAMPLE
The a(1) = 1 through a(6) = 13 twice-partitions:
((1)) ((2)) ((3)) ((4)) ((5)) ((6))
((21)) ((31)) ((32)) ((42))
((2)(1)) ((3)(1)) ((41)) ((51))
((21)(1)) ((3)(2)) ((321))
((4)(1)) ((4)(2))
((21)(2)) ((5)(1))
((31)(1)) ((21)(3))
((31)(2))
((3)(21))
((32)(1))
((41)(1))
((3)(2)(1))
((21)(2)(1))
MATHEMATICA
twiptn[n_]:=Join@@Table[Tuples[IntegerPartitions/@ptn], {ptn, IntegerPartitions[n]}];
Table[Length[Select[twiptn[n], UnsameQ@@#&&And@@UnsameQ@@@#&]], {n, 0, 10}]
PROG
(PARI) seq(n, k)={my(u=Vec(eta(x^2 + O(x*x^n))/eta(x + O(x*x^n))-1)); Vec(prod(k=1, n, my(c=u[k]); sum(j=0, min(c, n\k), x^(j*k)*c!/(c-j)!, O(x*x^n))))} \\ Andrew Howroyd, Dec 31 2022
CROSSREFS
The unordered version is A050342, non-strict A261049.
This is the distinct case of A270995.
The case of strictly decreasing sums is A279785.
The case of constant sums is A279791.
For distinct instead of weakly decreasing sums we have A336343.
This is the twice-partition case of A358913.
A001970 counts multiset partitions of integer partitions.
A055887 counts sequences of partitions.
A063834 counts twice-partitions.
A330462 counts set systems by total sum and length.
A358830 counts twice-partitions with distinct lengths.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 11 2022
EXTENSIONS
Terms a(26) and beyond from Andrew Howroyd, Dec 31 2022
STATUS
approved
Number of finite sequences of distinct sets with total sum n.
+10
3
1, 1, 1, 4, 6, 11, 28, 45, 86, 172, 344, 608, 1135, 2206, 4006, 7689, 13748, 25502, 47406, 86838, 157560, 286642, 522089, 941356, 1718622, 3079218, 5525805, 9902996, 17788396, 31742616, 56694704, 100720516, 178468026, 317019140, 560079704, 991061957
OFFSET
0,4
LINKS
FORMULA
a(n) = Sum_{k} A330462(n,k) * k!.
EXAMPLE
The a(1) = 1 through a(5) = 11 sequences of sets:
({1}) ({2}) ({3}) ({4}) ({5})
({1,2}) ({1,3}) ({1,4})
({1},{2}) ({1},{3}) ({2,3})
({2},{1}) ({3},{1}) ({1},{4})
({1},{1,2}) ({2},{3})
({1,2},{1}) ({3},{2})
({4},{1})
({1},{1,3})
({1,2},{2})
({1,3},{1})
({2},{1,2})
MAPLE
g:= proc(n) option remember; `if`(n=0, 1, add(g(n-j)*add(
`if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
end:
b:= proc(n, i, p) option remember; `if`(n=0, p!, `if`(i<1, 0,
add(binomial(g(i), j)*b(n-i*j, i-1, p+j), j=0..n/i)))
end:
a:= n-> b(n$2, 0):
seq(a(n), n=0..35); # Alois P. Heinz, Feb 13 2024
MATHEMATICA
ptnseq[n_]:=Join@@Table[Tuples[IntegerPartitions/@comp], {comp, Join@@Permutations/@IntegerPartitions[n]}];
Table[Length[Select[ptnseq[n], UnsameQ@@#&&And@@UnsameQ@@@#&]], {n, 0, 10}]
CROSSREFS
The unordered version is A050342, non-strict A261049.
The case of strictly decreasing sums is A279785.
This is the distinct case of A304969.
The case of distinct sums is A336343, constant sums A279791.
This is the case of A358906 with strict partitions.
The version for compositions instead of strict partitions is A358907.
The case of twice-partitions is A358914.
A001970 counts multiset partitions of integer partitions.
A055887 counts sequences of partitions.
A063834 counts twice-partitions.
A330462 counts set systems by total sum and length.
A358830 counts twice-partitions with distinct lengths.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 11 2022
STATUS
approved

Search completed in 0.008 seconds