A085364 a(0)=1, for n>0: a(n) = 6*13^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).
1, 6, 60, 654, 7458, 87378, 1042152, 12587730, 153479508, 1885010946, 23285957604, 289018502682, 3601315495050, 45023019250398, 564465885846216, 7094214579174558, 89351097367355826, 1127492973620753010
Offset: 0
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..200
Programs
-
Magma
R
:=PowerSeriesRing(Rationals(), 30); Coefficients(R!( Sqrt((1-x)/(1-13*x)) )); // G. C. Greubel, May 23 2020 -
Maple
seq(coeff(series( sqrt((1-x)/(1-13*x)) , x, n+1), x, n), n = 0..30); # G. C. Greubel, May 23 2020
-
Mathematica
CoefficientList[Series[Sqrt[(1-x)/(1-13x)], {x, 0, 25}], x]
-
PARI
my(x='x+O('x^66)); Vec(sqrt((1-x)/(1-13*x))) \\ Joerg Arndt, May 10 2013
-
Sage
def A085362_list(prec): P.
= PowerSeriesRing(ZZ, prec) return P( sqrt((1-x)/(1-13*x)) ).list() A085362_list(30) # G. C. Greubel, May 23 2020
Formula
G.f.: sqrt((1-x)/(1-13*x))
Sum_{i=0..n} Sum_{j=0..i} a(j)*a(i-j) = 13^n.
D-finite with recurrence: n*a(n) = 2*(7*n-4)*a(n-1) - 13*(n-2)*a(n-2). - Vaclav Kotesovec, Oct 14 2012
a(n) ~ 2*sqrt(3)*13^(n-1/2)/sqrt(Pi*n). - Vaclav Kotesovec, Oct 14 2012
a(0) = 1; a(n) = (6/n) * Sum_{k=0..n-1} (n+k) * a(k). - Seiichi Manyama, Mar 28 2023
From Seiichi Manyama, Aug 22 2025: (Start)
a(n) = (1/4)^n * Sum_{k=0..n} 13^k * binomial(2*k,k) * binomial(2*(n-k),n-k)/(1-2*(n-k)).
a(n) = Sum_{k=0..n} (-3)^k * 13^(n-k) * binomial(2*k,k)/(1-2*k) * binomial(n-1,n-k). (End)
Comments