cp's OEIS Frontend

A156554 The number of integer sequences of length d = 2n+1 such that the sum of the terms is 0 and the sum of the absolute values of the terms is d-1.

%I A156554 #52 Sep 26 2024 01:16:13
%S A156554 1,6,110,2562,66222,1815506,51697802,1511679210,45076309166,
%T A156554 1364497268946,41800229045610,1292986222651646,40317756506959050,
%U A156554 1265712901796074842,39965073938276694002,1268208750951634765562,40419340092267053380782,1293151592990764737265490
%N A156554 The number of integer sequences of length d = 2n+1 such that the sum of the terms is 0 and the sum of the absolute values of the terms is d-1.
%C A156554 Let b(n) = S(d,n) be the coordination sequence of the lattice A_d. Then this sequence is a(n) = S(2n,n). See Conway-Sloane. The sequence is defined by Couveignes et al.
%H A156554 R. H. Hardin and Colin Barker, <a href="/A156554/b156554.txt">Table of n, a(n) for n = 0..300</a> (terms up to n=26 from R. H. Hardin)
%H A156554 J. H. Conway and N. J. A. Sloane, Low-Dimensional Lattices VII: Coordination Sequences, Proc. Royal Soc. London, A453 (1997), 2369-2389 (<a href="http://neilsloane.com/doc/Me220.pdf">pdf</a>).
%H A156554 J.-M. Couveignes, T. Ezome, and R. Lercier, <a href="https://arxiv.org/abs/0810.2853">Elliptic periods and primality proving</a>, arXiv:0810.2853 [math.NT], 2008-2009.
%F A156554 a(n) = S(2n,n) where S(d,n) = Sum_{k=0..d} C(d,k)^2*C(n-k+d-1,d-1) from formula (22) in Conway-Sloane.
%F A156554 a(n) ~ (1 + sqrt(2))^(4*n + 1/2) / (2^(5/4) * Pi * n). - _Vaclav Kotesovec_, Apr 10 2018
%F A156554 From _Peter Bala_, Dec 19 2020: (Start)
%F A156554 a(n) = Sum_{k = 0..n} C(2*n,n-k)^2 * C(2*n+k-1,k).
%F A156554 a(n) = Sum_{k = 1..n} C(2*n, k)*C(2*n+k, k)*C(n-1,k-1) for n >= 1.
%F A156554 a(n) = [x^n] P(2*n,(1 + x)/(1 - x)), where P(n,x) denotes the n-th Legendre polynomial. Cf. A103882.
%F A156554 a(n) = C(2*n,n)^2 * hypergeom([-n, -n, 2*n], [n+1, n+1], 1).
%F A156554 n^2*(2*n - 1)^2*(24*n^3 - 105*n^2 + 152*n - 73)*a(n) = (3264*n^7 - 20808*n^6 + 53900*n^5 - 73159*n^4 + 55963*n^3 - 24107*n^2 + 5436*n - 504)*a(n - 1) - (2*n - 1)*(2*n - 3)*(n - 2)^2*(24*n^3 - 33*n^2 + 14*n - 2)*a(n - 2).
%F A156554 Conjectural: for any prime p >= 5, a(n*p^k) == a(n*p^(k-1)) ( mod p^(3*k) ) for all positive integers n and k.
%F A156554 More generally, if r and s are positive integers, we conjecture that the same supercongruences hold for the sequence defined by [x^(r*n)] P(s*n,(1 + x)/(1 - x)). (End)
%F A156554 Even more generally, we conjecture that the same supercongruences hold for the sequence defined by [x^(r*n)] (1 + x)^(A*n) * (1 - x)^(B*n) * P(s*n,(1 + x)/(1 - x)), where A and B are integers. - _Peter Bala_, Mar 17 2023
%F A156554 a(n) = 2*Sum_{k = 0..2*n-1} (-1)^(k+1)*binomial(2*n-1, k)*binomial(n+k, k)* binomial(2*n+k-1, k) for n >= 1. - _Peter Bala_, Sep 25 2024
%e A156554 The a(1) = 6 sequences are (1,-1,0), (-1,1,0), (1,0,-1), (-1,0,1), (0,1,-1) and (0,-1,1).
%p A156554 S:=proc(d,n) add(binomial(d,k)^2*binomial(n-k+d-1,d-1),k=0..d); end proc; a:=n->S(2*n,n);
%t A156554 Table[ Binomial[-1 + 3 n, -1 + 2 n] HypergeometricPFQ[{-2 n, -2 n, -n}, {1, 1 - 3 n}, 1], {n, 0, 10}]  (* _Eric W. Weisstein_, Feb 10 2009 *)
%o A156554 (PARI) S(d, n) = sum(k=0, d, binomial(d,k)^2*binomial(n-k+d-1, d-1));
%o A156554 concat(1, vector(20, n, S(2*n,n))) \\ _Colin Barker_, Dec 24 2015
%Y A156554 a(n) = A103881(2n, n), A103882.
%K A156554 easy,nice,nonn
%O A156554 0,2
%A A156554 _W. Edwin Clark_, Feb 09 2009
%E A156554 Formula incorrectly copied from A143699 removed by _R. J. Mathar_, Mar 11 2010