A091593 - OEIS

%I #48 Sep 01 2023 11:25:54

%S 1,-1,-1,5,-3,-21,51,41,-391,407,1927,-6227,-2507,49347,-71109,

%T -236079,966129,9519,-7408497,13685205,32079981,-167077221,60639939,

%U 1209248505,-2761755543,-4457338681,30629783831,-22124857219,-206064020315,572040039283,590258340811

%N Reversion of Jacobsthal numbers A001045.

%C Hankel transform is (-2)^C(n+1,2). - _Paul Barry_, Apr 28 2009

%H Seiichi Manyama, <a href="/A091593/b091593.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Res#revert">Index entries for reversions of series</a>

%F G.f.: (-(1+x)+sqrt(1+2*x+9*x^2))/(4*x^2). - Corrected by _Seiichi Manyama_, May 12 2019

%F a(n) = Sum_{k=0..floor(n/2)} binomial(n, 2*k)*C(k)*(-1)^(n-k)*2^k, where C(n) is A000108(n). - _Paul Barry_, May 16 2005

%F G.f.: 1/(1+x+2x^2/(1+x+2x^2/(1+x+2x^2/(1+x+2x^2/(1+ ... (continued fraction). - _Paul Barry_, Apr 28 2009

%F a(n) = Sum_{i=0..n} (2^(i)*(-1)^(n-i)*binomial(n+1,i)^2*(n-i+1)/(i+1))/(n+1). - _Vladimir Kruchinin_, Oct 12 2011

%F Conjecture: (n+2)*a(n) +(2*n+1)*a(n-1) +9*(n-1)*a(n-2)=0. - _R. J. Mathar_, Nov 26 2012

%F a(n) = (-1)^n*hypergeom([-n/2, (1-n)/2], [2], -8). - _Peter Luschny_, May 28 2014

%F R. J. Mathar's conjecture confirmed by Maple using this hypergeom form. - _Robert Israel_, Sep 22 2014

%F a(n) = Sum_{k = 0..n} (-2)^k * (1/(n+1))*binomial(n+1, k)*binomial(n+1, k+1) =  Sum_{k = 0..n} (-2)^k * N(n+1,k+1), where N(n,k) = A001263(n,k) are the Narayana numbers. - _Peter Bala_, Sep 01 2023

%p a := n -> hypergeom([-n,-n-1], [2], -2);

%p seq(simplify(a(n)), n=0..30); # _Peter Luschny_, Sep 22 2014

%p # Using function CompInv from A357588.

%p CompInv(25, n -> (2^n - (-1)^n)/3 ); # _Peter Luschny_, Oct 07 2022

%t a[n_] := Hypergeometric2F1[-n - 1, -n - 1, 2, -2] + (n + 1)*Hypergeometric2F1[-n, -n, 3, -2]; Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Oct 03 2016, after _Vladimir Kruchinin_ *)

%o (Maxima)

%o a(n):=sum(2^(i)*(-1)^(n-i)*binomial(n+1,i)^2*(n-i+1)/(i+1),i,0,n)/(n+1); (* _Vladimir Kruchinin_, Oct 12 2011 *)

%o (Sage) # Algorithm of L. Seidel (1877)

%o def A091593_list(n) :

%o     D = [0]*(n+2); D[1] = 1

%o     R = []; b = false; h = 1

%o     for i in range(2*n) :

%o         if b :

%o             for k in range(1, h, 1) : D[k] += -2*D[k+1]

%o             R.append(D[1])

%o         else :

%o             for k in range(h, 0, -1) : D[k] += D[k-1]

%o             h += 1

%o         b = not b

%o     return R

%o A091593_list(30)  # _Peter Luschny_, Oct 19 2012

%Y Cf. A001263, A154825.

%K easy,sign

%O 0,4

%A _Paul Barry_, Jan 23 2004