login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A336678 Number of paths of length n starting at initial node of the path graph P_11. 3
1, 1, 2, 3, 6, 10, 20, 35, 70, 126, 252, 461, 922, 1702, 3404, 6315, 12630, 23494, 46988, 87533, 175066, 326382, 652764, 1217483, 2434966, 4542526, 9085052, 16950573, 33901146, 63255670, 126511340, 236063915, 472127830, 880983606, 1761967212, 3287837741 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Also the number of paths along a corridor width 11, starting from one side.

In general, a(n,m) = (2^n/(m+1))*Sum_{r=1..m} (1-(-1)^r)*cos(Pi*r/(m+1))^n*(1+cos(Pi*r/(m+1))) gives the number of paths of length n starting at the initial node on the path graph P_m. Here we have m=11. - Herbert Kociemba, Sep 14 2020

LINKS

Table of n, a(n) for n=0..35.

Johann Cigler, Some remarks and conjectures related to lattice paths in strips along the x-axis, arXiv:1501.04750 [math.CO], 2015-2016.

Nachum Dershowitz, Between Broadway and the Hudson: A Bijection of Corridor Paths, arXiv:2006.06516 [math.CO], 2020.

Index entries for linear recurrences with constant coefficients, signature (0,6,0,-9,0,2).

FORMULA

G.f.: -(x^5+3*x^4-3*x^3-4*x^2+x+1)/((2*x^2-1)*(x^4-4*x^2+1)).

a(n) = (2^n/12)*Sum_{r=1..11} (1-(-1)^r)*cos(Pi*r/12)^n*(1+cos(Pi*r/12)). - Herbert Kociemba, Sep 14 2020

MAPLE

X := j -> (-1)^(j/12) - (-1)^(1-j/12):

a := k -> add((2 + X(j))*X(j)^k, j in [1, 3, 5, 7, 9, 11])/12:

seq(simplify(a(n)), n=0..30); # Peter Luschny, Sep 17 2020

MATHEMATICA

LinearRecurrence[{0, 6, 0, -9, 0, 2}, {1, 1, 2, 3, 6, 10}, 40] (* Harvey P. Dale, Sep 08 2020 *)

a[n_, m_]:=2^(n+1)/(m+1) Module[{x=(Pi r)/(m+1)}, Sum[Cos[x]^n (1+Cos[x]), {r, 1, m, 2}]]

Table[a[n, 11], {n, 0, 40}]//Round (* Herbert Kociemba, Sep 14 2020 *)

PROG

(PARI) my(x='x+O('x^44)); Vec(-(x^5+3*x^4-3*x^3-4*x^2+x+1)/((2*x^2-1)*(x^4-4*x^2+1))) \\ Joerg Arndt, Jul 31 2020

CROSSREFS

This is row 11 of A094718. Bisections give A087944 (even part), A087946 (odd part).

Cf. A000004 (row 0), A000007 (row 1), A000012 (row 2), A016116 (row 3), A000045 (row 4), A038754 (row 5), A028495 (row 6), A030436 (row 7), A061551 (row 8),

A178381 (row 9), A336675 (row 10), this sequence (row 11), A001405 (limit).

Sequence in context: A178381 A037031 A336675 * A056202 A001405 A126930

Adjacent sequences:  A336675 A336676 A336677 * A336679 A336680 A336681

KEYWORD

nonn,easy,walk

AUTHOR

Nachum Dershowitz, Jul 30 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 4 15:00 EST 2021. Contains 341796 sequences. (Running on oeis4.)