|
%I #31 Feb 22 2023 10:05:49
%S 2,4,3,8,8,4,16,26,12,5,32,64,44,16,6,64,164,132,62,20,7,128,384,376,
%T 200,80,24,8,256,904,1008,623,268,98,28,9,512,2048,2632,1792,870,336,
%U 116,32,10,1024,4624,6624,5040,2632,1117,404,134,36,11
%N Triangular array read by rows: T(n,k) is the number of multisets of exactly k nonempty binary words with a total of n letters.
%C Equivalently, T(n,k) is the number of partitions of the integer n with two types of 1's, four types of 2's, ..., 2^i types of i's...; having exactly k summands (of any type).
%C Row sums = A034899.
%H Alois P. Heinz, <a href="/A209406/b209406.txt">Rows n = 1..141, flattened</a>
%H <a href="/index/Mu#multiplicative_completely">Index entries for triangles generated by the Multiset Transformation</a>
%F O.g.f.: Product_{i>=1} 1/(1-y*x^i)^(2^i).
%e Triangle T(n,k) begins:
%e 2;
%e 4, 3;
%e 8, 8, 4;
%e 16, 26, 12, 5;
%e 32, 64, 44, 16, 6;
%e 64, 164, 132, 62, 20, 7;
%e 128, 384, 376, 200, 80, 24, 8;
%e 256, 904, 1008, 623, 268, 98, 28, 9;
%e 512, 2048, 2632, 1792, 870, 336, 116, 32, 10;
%e ...
%p b:= proc(n, i, p) option remember; `if`(p>n, 0, `if`(n=0, 1,
%p `if`(min(i, p)<1, 0, add(b(n-i*j, i-1, p-j)*
%p binomial(2^i+j-1, j), j=0..min(n/i, p)))))
%p end:
%p T:= (n, k)-> b(n$2, k):
%p seq(seq(T(n, k), k=1..n), n=1..14); # _Alois P. Heinz_, Apr 13 2017
%t nn = 10; p[x_, y_] := Product[1/(1 - y x^i)^(2^i), {i, 1, nn}]; f[list_] := Select[lst, # > 0 &]; Map[f, Drop[CoefficientList[Series[p[x, y], {x, 0, nn}], {x, y}], 1]] // Flatten
%Y Cf. A034899, A055375, A208741, A290222, A292506.
%Y T(2n,n) gives A359962.
%K nonn,tabl
%O 1,1
%A _Geoffrey Critzer_, Mar 08 2012
|
