cp's OEIS Frontend

A098479 Expansion of 1/sqrt((1-x)^2 - 4*x^3).

%I A098479 #72 Apr 29 2025 08:53:49
%S A098479 1,1,1,3,7,13,27,61,133,287,633,1407,3121,6943,15517,34755,77959,
%T A098479 175213,394499,889461,2007963,4538485,10269247,23258881,52726599,
%U A098479 119627977,271624315,617180533,1403272799,3192557561,7267485523,16552454205,37718893317,85992506271
%N A098479 Expansion of 1/sqrt((1-x)^2 - 4*x^3).
%C A098479 1/sqrt((1-x)^2-4*r*x^3) expands to Sum_{k=0..floor(n/2)} binomial(n-k,k)*binomial(n-2*k,k)*r^k.
%C A098479 Hankel transform is A120580. - _Paul Barry_, Sep 19 2008
%C A098479 From _Joerg Arndt_, Jul 01 2011:  (Start)
%C A098479 Apparently the number of lattice paths from (0,0) to (n,n) using steps (3,0), (0,3), (1,1).
%C A098479 It appears that 1/sqrt((1-x)^2-4*x^s) is the g.f. for lattice paths from (0,0) to (n,n) using steps (s,0), (0,s), (1,1).
%C A098479 Apparently the number of lattice paths from (0,0) to (n,n) using steps (1,2), (2,1), (1,1).  (End)
%C A098479 Diagonal of rational functions 1/(1 - (x*y + x*y^2 + x^2*y)), 1/(1 - (x*y + x^3 + y^3)). - _Gheorghe Coserea_, Aug 31 2018
%C A098479 Diagonal of the rational function 1 / ((1-x)*(1-y) - x^2*y^3). - _Seiichi Manyama_, Apr 29 2025
%H A098479 Michael De Vlieger, <a href="/A098479/b098479.txt">Table of n, a(n) for n = 0..2749</a>
%H A098479 Paul Barry, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Barry3/barry93.html">Continued fractions and transformations of integer sequences</a>, JIS 12 (2009) 09.7.6.
%H A098479 Hacène Belbachir, Abdelghani Mehdaoui, and László Szalay, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL22/Szalay/szalay42.html">Diagonal Sums in the Pascal Pyramid, II: Applications</a>, J. Int. Seq., Vol. 22 (2019), Article 19.3.5.
%H A098479 J. Cigler, <a href="http://arxiv.org/abs/1109.1449">Some nice Hankel determinants</a>, arXiv preprint arXiv:1109.1449 [math.CO], 2011.
%H A098479 Steffen Eger, <a href="http://arxiv.org/abs/1511.00622">On the Number of Many-to-Many Alignments of N Sequences</a>, arXiv:1511.00622 [math.CO], 2015.
%H A098479 Steffen Eger, <a href="https://arxiv.org/abs/1704.04964">The Combinatorics of Weighted Vector Compositions</a>, arXiv:1704.04964 [math.CO], 2017.
%F A098479 a(n) = Sum_{k=0..floor(n/2)} binomial(n-k, k)*binomial(n-2*k, k).
%F A098479 D-finite with recurrence: n*a(n) + (-2*n+1)*a(n-1) + (n-1)*a(n-2) + 2*(-2*n+3)*a(n-3) = 0. - _R. J. Mathar_, Nov 30 2012
%F A098479 G.f.: 1/(1 - x - 2*x^3/(1 - x - x^3/(1 - x - x^3/(1 - x - x^3/(1 - ...))))), a continued fraction. - _Ilya Gutkovskiy_, Nov 19 2021
%F A098479 a(n) ~ 1 / (sqrt((1-r)*(3-r)) * sqrt(Pi*n) * r^n), where r = 0.432040800333095... is the real root of the equation -1 + 2*r - r^2 + 4*r^3 = 0. - _Vaclav Kotesovec_, Jun 05 2022
%e A098479 From _Joerg Arndt_, Jul 01 2011: (Start)
%e A098479 The triangle of lattice paths from (0,0) to (n,k) using steps (1,2), (2,1), (1,1) begins
%e A098479   1;
%e A098479   0, 1;
%e A098479   0, 1, 1;
%e A098479   0, 0, 2, 3;
%e A098479   0, 0, 1, 3, 7;
%e A098479   0, 0, 0, 3, 7, 13;
%e A098479   0, 0, 0, 1, 6, 17, 27;
%e A098479   0, 0, 0, 0, 4, 14, 36, 61;
%e A098479 The triangle of lattice paths from (0,0) to (n,k) using steps (3,0), (0,3), (1,1) begins
%e A098479   1;
%e A098479   0, 1;
%e A098479   0, 0, 1;
%e A098479   1, 0, 0, 3;
%e A098479   0, 2, 0, 0,  7;
%e A098479   0, 0, 3, 0,  0, 13;
%e A098479   1, 0, 0, 7,  0,  0, 27;
%e A098479   0, 3, 0, 0, 17,  0,  0, 61;
%e A098479 The diagonals of both appear to be this sequence.  (End)
%t A098479 a[n_] := Sum[ Binomial[n-k, k]*Binomial[n-2k, k], {k, 0, n/2}]; Table[a[n], {n, 0, 31}] (* _Jean-François Alcover_, Jan 07 2013, from 1st formula *)
%t A098479 CoefficientList[Series[1/Sqrt[(1-x)^2-4x^3],{x,0,40}],x] (* _Harvey P. Dale_, Aug 13 2024 *)
%o A098479 (PARI) /* as lattice paths, assuming the first comment is true */
%o A098479 /* same as in A092566 but use either of the following */
%o A098479 steps=[[3,0], [0,3], [1,1]];
%o A098479 steps=[[1,1], [1,2], [2,1]];
%o A098479 /* _Joerg Arndt_, Jul 01 2011 */
%o A098479 (Python)
%o A098479 from sympy import binomial
%o A098479 def a(n): return sum(binomial(n - k, k) * binomial(n - 2*k, k) for k in range(n//2 + 1))
%o A098479 print([a(n) for n in range(31)]) # _Indranil Ghosh_, Apr 18 2017
%Y A098479 Cf. A098480, A098481.
%K A098479 easy,nonn
%O A098479 0,4
%A A098479 _Paul Barry_, Sep 10 2004