[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A322538
Number of arrays of n integers in -8..8 with sum zero.
2
1, 1, 17, 217, 3281, 50101, 782153, 12354469, 197018321, 3164588407, 51125645317, 829858058019, 13522838817929, 221088393889403, 3624855419439957, 59576725303913167, 981272544393935569, 16192709833199300337, 267654541150392845543, 4430755975190532983531
OFFSET
0,3
LINKS
FORMULA
a(n) = [x^(8*n)] (Sum_{k=0..16} x^k)^n.
a(n) ~ 17^n / (4*sqrt(3*Pi*n)). - Vaclav Kotesovec, Dec 15 2018
MAPLE
seq(add((-1)^k*binomial(n, k)*binomial(9*n-17*k-1, n-1), k = 0..floor(n/2)), n = 0..20); # Peter Bala, Oct 19 2024
MATHEMATICA
a[n_] := If[n==0, 1, Coefficient[Expand[Sum[x^k, {k, 0, 16}]^n], x^(8n)]]; Array[a, 25, 0] (* Amiram Eldar, Dec 14 2018 *)
PROG
(PARI) {a(n) = polcoeff((sum(k=0, 16, x^k))^n, 8*n, x)}
CROSSREFS
Column 8 of A201552.
Sequence in context: A139733 A016185 A125452 * A016238 A016181 A285233
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Dec 14 2018
STATUS
approved