cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A182897 Number of (1,-1)-returns to the horizontal axis in all weighted lattice paths in L_n. The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.

Original entry on oeis.org

0, 0, 0, 1, 3, 9, 27, 76, 211, 580, 1578, 4267, 11484, 30789, 82301, 219465, 584060, 1551770, 4117061, 10910049, 28881387, 76387179, 201875129, 533145603, 1407161007, 3711981168, 9787157469, 25793933410, 67952779665, 178954077522
Offset: 0

Views

Author

Emeric Deutsch, Dec 13 2010

Keywords

Comments

a(n)=Sum(k*A182896(n,k), k>=0).

Examples

			a(3)=1 because, denoting by h (H) the (1,0)-step of weight 1 (2), and u=(1,1), d=(1,-1), the five paths of weight 3 are ud, du, hH, Hh, and hhh; they contain 1+0+0+0+0=1  (1,-1)-return to the horizontal axis.
		

References

  • M. Bona and A. Knopfmacher, On the probability that certain compositions have the same number of parts, Ann. Comb., 14 (2010), 291-306.
  • E. Munarini, N. Zagaglia Salvi, On the rank polynomial of the lattice of order ideals of fences and crowns, Discrete Mathematics 259 (2002), 163-177.

Crossrefs

Programs

  • Maple
    eq := c = 1+z*c+z^2*c+z^3*c^2: c := RootOf(eq, c): G := z^3*c/((1+z+z^2)*(1-3*z+z^2)): Gser := series(G, z = 0, 32): seq(coeff(Gser, z, n), n = 0 .. 29);
  • Mathematica
    CoefficientList[Series[x^3*(1 - x - x^2 - Sqrt[1+x^4-2*x^3-x^2-2*x]) / (2*x^3*(1+x+x^2)*(1-3*x+x^2)), {x, 0, 20}], x] (* Vaclav Kotesovec, Mar 06 2016 *)

Formula

G.f.: G(z)=z^3*c/[(1+z+z^2)(1-3z+z^2)], where c satisfies c = 1+zc+z^2*c+z^3*c^2.
a(n) ~ ((1 + sqrt(5))/2)^(2*n+1) / (4*sqrt(5)). - Vaclav Kotesovec, Mar 06 2016
D-finite with recurrence n*a(n) +(-4*n+3)*a(n-1) +(2*n-3)*a(n-2) +11*(n-3)*a(n-4) +(2*n-9)*a(n-6) +(-4*n+21)*a(n-7) +(n-6)*a(n-8)=0. - R. J. Mathar, Jul 24 2022

A182899 Number of returns to the horizontal axis (both from above and below) in all weighted lattice paths in L_n.

Original entry on oeis.org

0, 0, 0, 2, 6, 18, 54, 152, 422, 1160, 3156, 8534, 22968, 61578, 164602, 438930, 1168120, 3103540, 8234122, 21820098, 57762774, 152774358, 403750258, 1066291206, 2814322014, 7423962336, 19574314938, 51587866820, 135905559330, 357908155044
Offset: 0

Views

Author

Emeric Deutsch, Dec 13 2010

Keywords

Comments

The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.

Examples

			a(3)=2 because, denoting by h (H) the (1,0)-step of weight 1 (2), and u=(1,1), d=(1,-1), the five paths of weight 3 are ud, du, hH, Hh, and hhh; they contain 1+1+0+0+0=1  returns to the horizontal axis.
		

Crossrefs

Programs

  • Maple
    eq := c = 1+z*c+z^2*c+z^3*c^2: c := RootOf(eq, c): G := 2*z^3*c/((1+z+z^2)*(1-3*z+z^2)): Gser := series(G, z = 0, 32): seq(coeff(Gser, z, n), n = 0 .. 29);

Formula

a(n) = Sum_{k>=0} k*A182898(n,k).
a(n) = 2*A182897(n).
G.f.: 2*z^3*c/((1+z+z^2)*(1-3*z+z^2)), where c satisfies c = 1+z*c+z^2*c+z^3*c^2.
Conjecture D-finite with recurrence n*a(n) +(-4*n+3)*a(n-1) +(2*n-3)*a(n-2) +11*(n-3)*a(n-4) +(2*n-9)*a(n-6) +(-4*n+21)*a(n-7) +(n-6)*a(n-8)=0. - R. J. Mathar, Jul 22 2022
Showing 1-2 of 2 results.