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!)
A322537 Number of arrays of 10 integers in -n..n with sum zero. 2

%I

%S 1,8953,856945,17538157,167729959,1018872811,4577127763,16581420835,

%T 51125645317,139071924069,342237634221,775938666273,1643151128475,

%U 3284313415527,6247630238079,11385659856231,19984965376233,33936690554865,55957080110537,89868204063989,140950465124591

%N Number of arrays of 10 integers in -n..n with sum zero.

%H Seiichi Manyama, <a href="/A322537/b322537.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = [x^(10*n)] (Sum_{k=0..2*n} x^k)^10.

%t a[n_] := Coefficient[Expand[Sum[x^k, {k, 0, 2n}]^10, x], x, 10n]; Array[a, 25, 0] (* _Amiram Eldar_, Dec 14 2018 *)

%o (PARI) {a(n) = polcoeff((sum(k=0, 2*n, x^k))^10, 10*n, x)}

%Y Row 10 of A201552.

%K nonn

%O 0,2

%A _Seiichi Manyama_, Dec 14 2018

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 2 02:09 EDT 2023. Contains 361723 sequences. (Running on oeis4.)