A107264
Expansion of (1 - 3*x - sqrt((1-3*x)^2 - 4*3*x^2))/(2*3*x^2).
Original entry on oeis.org
1, 3, 12, 54, 261, 1323, 6939, 37341, 205011, 1143801, 6466230, 36960300, 213243435, 1240219269, 7263473148, 42799541886, 253556163243, 1509356586897, 9023497273548, 54154973176074, 326154592965879, 1970575690572297
Offset: 0
- Vincenzo Librandi, Table of n, a(n) for n = 0..200
- Alexander Burstein and Louis W. Shapiro, Pseudo-involutions in the Riordan group and Chebyshev polynomials, arXiv:2502.13673 [math.CO], 2025.
- N. Gabriel, K. Peske, L. Pudwell, and S. Tay, Pattern Avoidance in Ternary Trees, J. Int. Seq. 15 (2012) # 12.1.5.
- Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011.
- L. Pudwell, Pattern avoidance in trees, (slides from a talk, mentions many sequences), 2012. - From _N. J. A. Sloane_, Jan 03 2013
-
CoefficientList[Series[(1-3*x-Sqrt[1-6*x-3*x^2])/(6*x^2), {x, 0, 20}], x] (* Vaclav Kotesovec, Oct 17 2012 *)
A260774
Certain directed lattice paths.
Original entry on oeis.org
1, 6, 33, 189, 1107, 6588, 39663, 240894, 1473147, 9058554, 55954395, 346934745, 2157989445, 13459891500, 84152389833, 527224251861, 3309194474451, 20804569738218, 130987600581699, 825796890644895, 5212349717906889, 32935490120006604, 208316726580941037
Offset: 0
-
b:= proc(x, y) option remember; `if`([x, y]=[0$2], 1,
`if`(x>0, add(b(x-1, y+j), j=-1..1), 0)+
`if`(y>0, b(x, y-1), 0)+`if`(y<0, b(x, y+1), 0))
end:
a:= n-> b(n, 1):
seq(a(n), n=0..23); # Alois P. Heinz, Sep 21 2021
-
b[x_, y_] := b[x, y] = If[{x, y} == {0, 0}, 1,
If[x > 0, Sum[b[x - 1, y + j], {j, -1, 1}], 0] +
If[y > 0, b[x, y - 1], 0] + If[y < 0, b[x, y + 1], 0]];
a[n_] := b[n, 1];
Table[a[n], {n, 0, 23}] (* Jean-François Alcover, May 02 2022, after Alois P. Heinz *)
A260772
Certain directed lattice paths.
Original entry on oeis.org
1, 3, 10, 41, 190, 946, 4940, 26693, 147990, 837102, 4811860, 28027210, 165057100, 981177060, 5879570200, 35478788269, 215398416870, 1314794380374, 8064119033220, 49673222082782, 307163049317540, 1906066361809148, 11865666767361960, 74081851132379426
Offset: 0
- Lars Blomberg, Table of n, a(n) for n = 0..100
- M. Dziemianczuk, On Directed Lattice Paths With Additional Vertical Steps, arXiv preprint arXiv:1410.5747 [math.CO], 2014.
- M. Dziemianczuk, On Directed Lattice Paths With Additional Vertical Steps, Discrete Mathematics, Volume 339, Issue 3, 6 March 2016, Pages 1116-1139.
- Heba Bou KaedBey, Mark van Hoeij, and Man Cheung Tsui, Solving Third Order Linear Difference Equations in Terms of Second Order Equations, arXiv:2402.11121 [math.AC], 2024. See p. 3.
-
# A260772 satisfies a 4th-order recurrence that can be reduced
# to a 2nd-order recurrence given in this program t:
t := proc(n) options remember;
if n <= 1 then
[-1/2, 0, 1, 4][2*n+2]
else
(16*(n-2)*(2*n-3)*(5*n-2)*t(n-2) + (440*n^3-1056*n^2+724*n-144)*t(n-1))
/( n*(2*n+1)*(5*n-7) )
fi
end:
A260772 := proc(n)
t(n/2) + ( (2-2*n)*t((n-1)/2)+(n+2)*t((n+1)/2) ) / (1+5*n)
end:
seq(A260772(i),i=0..100);
# Mark van Hoeij, Jul 14 2022
-
a(n):=if n=0 then 1 else sum((-1)^j*binomial(n,j)*binomial(3*n-4*j,n-4*j+1),j,0,(n+1)/4)/n; /* Vladimir Kruchinin, Apr 04 2019 */
-
a(n) = if (n==0, 1, sum(j=0, (n+1)/4, (-1)^j*binomial(n,j)*binomial(3*n-4*j, n-4*j+1))/n); \\ Michel Marcus, Apr 05 2019
A371657
G.f. satisfies A(x) = 1 + x * A(x)^2 * (1 + A(x) + A(x)^2).
Original entry on oeis.org
1, 3, 27, 333, 4752, 73764, 1209492, 20610693, 361403937, 6478386561, 118181952369, 2186908154748, 40949739595242, 774474351098031, 14772979729013247, 283878381945510621, 5490264493926636912, 106786725176131118523, 2087502569999563971843
Offset: 0
-
a(n) = if(n==0, 1, sum(k=0, (n-1)\2, 3^(n-k)*binomial(n, k)*binomial(3*n-k, n-1-2*k))/n);
Showing 1-4 of 4 results.
Comments