|
%I #11 Jul 23 2019 02:02:44
%S 1,1,1,1,3,1,1,4,4,1,1,7,12,7,1,1,6,18,18,6,1,1,12,24,42,24,12,1,1,8,
%T 32,48,48,32,8,1,1,15,56,120,144,120,56,15,1,1,13,91,224,312,312,224,
%U 91,13,1,1,18,78,360,576,728,576,360,78,18,1,1,12,72,288,864,1152,1152,864
%N Triangle read by rows: T(n,k) = sigma(binomial(n,k)) (0 <= k <= n), where sigma(m) is the sum of the positive divisors of m.
%C Row n contains n+1 terms. Row sums yield A074801. T(2n,n) = A067819(n).
%H T. D. Noe, <a href="/A102716/b102716.txt">Rows n = 0..100 of triangle, flattened</a>
%F T(n, k) = sigma(binomial(n, k)) (0 <= k <= n).
%e T(6,3)=42 because the sum of the divisors of binomial(6,3)=20 is 1+2+4+5+10+20=42.
%e Triangle begins:
%e 1;
%e 1, 1;
%e 1, 3, 1;
%e 1, 4, 4, 1;
%e 1, 7, 12, 7, 1;
%p with(numtheory): T:=(n,k)->sigma(binomial(n,k)): for n from 0 to 11 do seq(T(n,k),k=0..n) od; # yields sequence in triangular form
%t Table[DivisorSigma[1,Binomial[n,k]],{n,0,20},{k,0,n}]//Flatten (* _Harvey P. Dale_, Mar 25 2016 *)
%Y Cf. A074801, A067819.
%K nonn,tabl
%O 0,5
%A _Emeric Deutsch_, Feb 06 2005
|
