cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A322536 Number of arrays of 9 integers in -n..n with sum zero.

This page as a plain text file.
%I A322536 #15 Oct 01 2024 11:05:27
%S A322536 1,3139,180325,2636263,19610233,97464799,370487485,1163205475,
%T A322536 3164588407,7702189345,17148949027,35500063501,69161990275,
%U A322536 128000343121,226698100687,386480229085,637265493637,1020310909975,1591418959705,2424782370859,3617545938373,5295169534843
%N A322536 Number of arrays of 9 integers in -n..n with sum zero.
%H A322536 Seiichi Manyama, <a href="/A322536/b322536.txt">Table of n, a(n) for n = 0..10000</a>
%H A322536 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (9, -36, 84, -126, 126, -84, 36, -9, 1).
%F A322536 a(n) = [x^(9*n)] (Sum_{k=0..2*n} x^k)^9.
%t A322536 a[n_] := Coefficient[Expand[Sum[x^k, {k, 0, 2n}]^9, x], x, 9n]; Array[a, 25, 0] (* _Amiram Eldar_, Dec 14 2018 *)
%o A322536 (PARI) {a(n) = polcoeff((sum(k=0, 2*n, x^k))^9, 9*n, x)}
%Y A322536 Row 9 of A201552.
%K A322536 nonn
%O A322536 0,2
%A A322536 _Seiichi Manyama_, Dec 14 2018