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!)
A089671 a(n) = S3(n,3), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3. 4

%I #10 May 27 2022 07:25:00

%S 0,8,539,16632,364042,6510160,101817234,1447146512,19144522160,

%T 239513659776,2865559784050,33052451375152,369790434398988,

%U 4031805422883680,42996629236138928,449821323139340160,4627609615665499456,46907404618252667392,469254490696475078130

%N a(n) = S3(n,3), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.

%H G. C. Greubel, <a href="/A089671/b089671.txt">Table of n, a(n) for n = 0..1000</a>

%H Jun Wang and Zhizheng Zhang, <a href="http://dx.doi.org/10.1016/S0012-365X(03)00206-1">On extensions of Calkin's binomial identities</a>, Discrete Math., 274 (2004), 331-342.

%F a(n) = Sum_{k=0..n} k^3 *(Sum_{j=0..k} binomial(n,j))^3. - _G. C. Greubel_, May 26 2022

%F a(n) ~ 15 * 2^(3*n-6) * n^4 * (1 - 2/(5*sqrt(Pi*n)) + (2 - sqrt(3)/(5*Pi))/n). - _Vaclav Kotesovec_, May 27 2022

%t a[n_]:= a[n]= Sum[k^3*(Sum[Binomial[n, j], {j,0,k}])^3, {k,0,n}];

%t Table[a[n], {n, 0, 40}] (* _G. C. Greubel_, May 26 2022 *)

%o (SageMath)

%o def A089671(n): return sum(k^3*(sum(binomial(n,j) for j in (0..k)))^3 for k in (0..n))

%o [A089671(n) for n in (0..40)] # _G. C. Greubel_, May 26 2022

%Y Sequences of S3(n, t): A007403 (t=0), A089669 (t=1), A089670 (t=2), this sequence (t=3), A089672 (t=4).

%Y Cf. A089658, A089664.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Jan 04 2004

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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)