login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185731 Array by antidiagonals: T(n,k)=F*(k*n-n+3*k+13), where F = k*(k+1)*(k+2)*n*(n+1)*(n+2)/576. 2

%I #8 Jul 12 2017 03:17:54

%S 1,5,4,15,21,10,35,65,55,20,70,155,175,115,35,126,315,425,375,210,56,

%T 210,574,875,925,700,350,84,330,966,1610,1925,1750,1190,546,120,495,

%U 1530,2730,3570,3675,3010,1890,810,165,715,2310,4350,6090,6860,6370,4830,2850,1155,220,1001,3355,6600

%N Array by antidiagonals: T(n,k)=F*(k*n-n+3*k+13), where F = k*(k+1)*(k+2)*n*(n+1)*(n+2)/576.

%C This is the accumulation array of A185730. (See A144112 for the definition of accumulation array.)

%H G. C. Greubel, <a href="/A185731/b185731.txt">Table of n, a(n) for the first 50 rows, flattened</a>

%F T(n,k) = F*(k*n-n+3*k+13), where F = k*(k+1)*(k+2)*n*(n+1)*(n+2)/576.

%e Northwest corner:

%e 1.....5....15....35....70

%e 4.....21...65....155...315

%e 10....55...175...425...875

%e 20....115..375...925...1925

%t f[n_,k_]:=k(1+k)n(1+n)(7+2k-n+k*n)/36;

%t TableForm[Table[f[n,k],{n,1,10},{k,1,15}]] (* A185730 *)

%t Table[f[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten

%t s[n_,k_]:=Sum[f[i,j],{i,1,n},{j,1,k}]; (* acc. arr. of {f(n,k)} *)

%t Factor[s[n,k]] (* formula for A185731 *)

%t TableForm[Table[s[n,k],{n,1,10},{k,1,15}]] (* array A185731 *)

%t Table[s[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten (* A185731 *)

%Y Cf. A144112, A185730.

%K nonn,tabl

%O 1,2

%A _Clark Kimberling_, Feb 01 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)