|
%I #25 May 06 2023 11:12:45
%S 1,0,1,0,0,1,1,0,0,1,1,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,0,1,1,1,0,0,0,0,
%T 0,1,2,1,0,0,0,0,0,0,1,2,1,0,0,0,0,0,0,0,1,3,1,0,0,0,0,0,0,0,0,1,3,1,
%U 1,0,0,0,0,0,0,0,0,1,4,1,1,0,0,0,0,0,0,0,0,0,1,4,1,1,0,0,0,0,0,0,0,0,0,0,1
%N Triangle T(n,k), n >= 1, 1 <= k <= n, read by rows, where T(n,k) is the number of partitions of n such that (smallest part) = k*(number of parts).
%C Column k is asymptotic to (1 - alfa) * exp(2*sqrt(n*(k*log(alfa)^2 + polylog(2, 1 - alfa)))) * (k*log(alfa)^2 + polylog(2, 1 - alfa))^(1/4) / (2*sqrt(Pi) * sqrt(alfa + 2*k - 2*alfa*k) * n^(3/4)), where alfa is positive real root of the equation alfa^(2*k) + alfa - 1 = 0. - _Vaclav Kotesovec_, Jan 21 2022
%H Andrew Howroyd, <a href="/A350890/b350890.txt">Table of n, a(n) for n = 1..1275</a> (rows 1..50).
%F G.f. of column k: Sum_{i>=1} x^(k*i^2)/Product_{j=1..i-1} (1-x^j).
%e Triangle begins:
%e 1;
%e 0, 1;
%e 0, 0, 1;
%e 1, 0, 0, 1;
%e 1, 0, 0, 0, 1;
%e 1, 0, 0, 0, 0, 1;
%e 1, 0, 0, 0, 0, 0, 1;
%e 1, 1, 0, 0, 0, 0, 0, 1;
%e 2, 1, 0, 0, 0, 0, 0, 0, 1;
%e 2, 1, 0, 0, 0, 0, 0, 0, 0, 1;
%e 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%o (PARI) T(n, k) = polcoef(sum(i=1, sqrtint(n\k), x^(k*i^2)/prod(j=1, i-1, 1-x^j+x*O(x^n))), n);
%o (Ruby)
%o def partition(n, min, max)
%o return [[]] if n == 0
%o [max, n].min.downto(min).flat_map{|i| partition(n - i, min, i).map{|rest| [i, *rest]}}
%o end
%o def A(n)
%o a = Array.new(n, 0)
%o partition(n, 1, n).each{|ary|
%o (1..n).each{|i|
%o a[i - 1] += 1 if ary[-1] == i * ary.size
%o }
%o }
%o a
%o end
%o def A350890(n)
%o (1..n).map{|i| A(i)}.flatten
%o end
%o p A350890(14)
%Y Row sums give A168656.
%Y Column k=1..5 give A006141, A350893, A350894, A350898, A350899.
%Y Cf. A350879, A350889.
%K nonn,tabl
%O 1,37
%A _Seiichi Manyama_, Jan 21 2022
|
