# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a025250
Showing 1-1 of 1

%I A025250 #56 Mar 10 2023 19:19:34
%S A025250 0,1,1,0,1,1,1,3,3,6,11,15,31,50,85,161,267,490,883,1548,2863,5127,
%T A025250 9307,17116,31021,57123,104963,192699,356643,658034,1218517,2262079,
%U A025250 4196895,7812028,14549655,27126118,50671255,94697293,177220411,332015747
%N A025250 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4.
%C A025250 Number of lattice paths from (0,0) to (n-3,0) that stay weakly in the first quadrant and such that each step is either U=(1,1),D=(2,-1), or H=(2,0). E.g. a(10)=6 because we have HHUD, HUDH, HUHD, UDHH, UHDH and UHHD. - _Emeric Deutsch_, Dec 23 2003
%C A025250 Hankel transform of a(n+2) is Somos-4 variant A050512. - _Paul Barry_, Jul 05 2009
%H A025250 Reinhard Zumkeller, <a href="/A025250/b025250.txt">Table of n, a(n) for n = 1..1000</a>
%H A025250 Andrei Asinowski, Cyril Banderier, and Valerie Roitner, <a href="https://lipn.univ-paris13.fr/~banderier/Papers/several_patterns.pdf">Generating functions for lattice paths with several forbidden patterns</a>, (2019).
%H A025250 Paul Barry, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL19/Barry/barry321.html">Jacobsthal Decompositions of Pascal's Triangle, Ternary Trees, and Alternating Sign Matrices</a>, Journal of Integer Sequences, 19, 2016, #16.3.5.
%H A025250 Paul Barry, <a href="https://arxiv.org/abs/1807.05794">Riordan Pseudo-Involutions, Continued Fractions and Somos 4 Sequences</a>, arXiv:1807.05794 [math.CO], 2018.
%F A025250 G.f.: (1 +x^2 -sqrt(1-2*x^2-4*x^3+x^4))/2. - _Michael Somos_, Jun 08 2000
%F A025250 G.f.: x^2+x^3*(1/(1-x^2))c(x^3/(1-x^2)^2) where c(x) is the g.f. of A000108. - _Paul Barry_, May 20 2009
%F A025250 a(n+2) = Sum_{k=0..n} binomial((n+k)/2, 2*k)(1+(-1)^(n-k))*A000108(k)/2}. - _Paul Barry_, Jul 06 2009
%F A025250 a(n) = Sum_{k=0..n} binomial(k+1,n-2*k-1)*binomial(n-k-2,k)/(k+1). - _Vladimir Kruchinin_, Nov 22 2014
%F A025250 G.f.: K_{k>=0} (-x^3)/(x^2-1), where K is the Gauss notation for a continued fraction. - _Benedict W. J. Irwin_, Oct 11 2016
%F A025250 a(n) ~ sqrt(1 - r^2 - r^3) * (2*r + 4*r^2 - r^3)^n / (2*sqrt(Pi)*n^(3/2)), where r = 0.51361982956383128341133963576515885989214886200017191578885... is the root of the equation 1 - 2*r^2 - 4*r^3 + r^4 = 0. - _Vaclav Kotesovec_, Jul 03 2021
%F A025250 Shifts left 3 places under the INVERT transform. - _J. Conrad_, Mar 08 2023
%t A025250 Rest[CoefficientList[Series[(1+x^2-Sqrt[1-2*x^2-4*x^3+x^4])/2, {x,0,40}],x]]  (* _Harvey P. Dale_, Apr 05 2011 *)
%t A025250 Rest@CoefficientList[Series[x^2+ContinuedFractionK[-x^3,x^2-1,{k, 0, 40}],{x,0,40}], x] (* _Benedict W. J. Irwin_, Oct 13 2016 *)
%o A025250 (PARI) a(n)=polcoeff((x^2-sqrt(1-2*x^2-4*x^3+x^4+x*O(x^n)))/2,n)
%o A025250 (Haskell)
%o A025250 a025250 n = a025250_list !! (n-1)
%o A025250 a025250_list = 0 : 1 : 1 : f 1 [1,1,0] where
%o A025250    f k xs = x' : f (k+1) (x':xs) where
%o A025250      x' = sum $ zipWith (*) a025250_list $ take k xs
%o A025250 -- _Reinhard Zumkeller_, Nov 03 2011
%o A025250 (Maxima)
%o A025250 a(n):=sum((binomial(k+1,n-2*k-1)*binomial(n-k-2,k))/(k+1),k,0,n); /* _Vladimir Kruchinin_, Nov 22 2014 */
%o A025250 (Magma) m:=45; R<x>:=PowerSeriesRing(Rationals(), m); [0] cat Coefficients(R!( (1 +x^2 -Sqrt(1-2*x^2-4*x^3+x^4))/2 )); // _G. C. Greubel_, Feb 23 2019
%o A025250 (Sage) a=((1+x^2 -sqrt(1-2*x^2-4*x^3+x^4))/2).series(x, 45).coefficients(x, sparse=False); a[1:] # _G. C. Greubel_, Feb 23 2019
%o A025250 (GAP) List([0..45], n-> Sum([0..n], k-> binomial(k+1,n-2*k-1)*binomial(n-k-2,k)/(k+1) )) # _G. C. Greubel_, Feb 23 2019
%K A025250 nonn
%O A025250 1,8
%A A025250 _Clark Kimberling_

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE