|
%I #10 Jul 13 2017 03:07:53
%S 1,4,4,10,15,10,20,36,36,20,35,70,84,70,35,56,120,160,160,120,56,84,
%T 189,270,300,270,189,84,120,280,420,500,500,420,280,120,165,396,616,
%U 770,825,770,616,396,165,220,540,864,1120,1260,1260,1120,864,540,220,286,715,1170,1560,1820,1911,1820,1560,1170,715,286,364,924,1540,2100,2520,2744,2744,2520,2100,1540,924,364,455,1170,1980,2750,3375,3780,3920,3780,3375,2750,1980,1170,455,560
%N Accumulation array of A107985, by antidiagonals.
%C Let W be the array given by w(1,1)=1, w(2,2)=-1, and w(n,k)=0 for all other (n,k).
%C Write "A < B" to indicate that an array B is the accumulation array of A (defined at A144112). Then W < A103451 < A002024 < A107985 < A185784 < A185785 < A185786.
%H G. C. Greubel, <a href="/A185784/b185784.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%F T(n,k) = (n+k+1)*C(n+1,2)*C(k+1,2)/3, k>=0, n>=0.
%e Northwest corner:
%e 1....4....10....20....35
%e 4....15...36....70....120
%e 10...36...84....160...270
%e 20...70...160...300...500
%t (* The code generates arrays A107985, A185784, A002024. *)
%t f[n_,0]:=0;f[0,k_]:=0; (* used to form A002024 *)
%t f[n_,k_]:=k*n(k+n)/2;
%t TableForm[Table[f[n,k],{n,1,10},{k,1,15}]] (* A107985 *)
%t s[n_,k_]:=Sum[f[i,j],{i,1,n},{j,1,k}]; (* accumulation array of {f(n,k)} *)
%t FullSimplify[s[n,k]]
%t TableForm[Table[s[n,k],{n,1,10},{k,1,15}]] (* A185784 *)
%t Table[s[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten
%t w[m_,n_]:=f[m,n]+f[m-1,n-1]-f[m,n-1]-f[m-1,n]/;Or[m>0,n>0];
%t TableForm[Table[w[n,k],{n,1,10},{k,1,15}]] (* A002024 *)
%Y Cf. A144112, A103451, A002024, A107985, A185784, A185785, A185786.
%K nonn,tabl
%O 1,2
%A _Clark Kimberling_, Feb 03 2011
|
