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.

A329673 Number of meanders of length n with Motzkin-steps avoiding the consecutive steps HH.

Original entry on oeis.org

1, 2, 4, 10, 24, 60, 152, 388, 1000, 2592, 6752, 17664, 46368, 122080, 322240, 852464, 2259552, 5999552, 15954560, 42486592, 113282048, 302386304, 807999744, 2161077120, 5785032448, 15498450944, 41551965184, 111478804480, 299274439680, 803905119232, 2160632498176, 5810087371520
Offset: 0

Views

Author

Valerie Roitner, Nov 26 2019

Keywords

Comments

The Motzkin step set is U=(1,1), H=(1,0) and D=(1,-1). A meander is a path starting at (0,0) and never crossing the x-axis, i.e., staying at nonnegative altitude.

Examples

			a(2)=4 since we have 4 meanders of length 2 avoiding HH, namely UU, UH, UD and HU.

Crossrefs

Cf. A104545 which counts excursions avoiding consecutive HH steps. Cf. A329672 and A329674 which count meanders avoiding consecutive UU and DD respectively.

Formula

G.f.: -(1-2*t-2*t^2-sqrt(1-4*t^2-8*t^3-4*t^4))/(2*t*(1-2*t-2*t^2)).
D-finite with recurrence (n+1)*a(n) -2*a(n-1) -4*n*a(n-2) +8*(-n+2)*a(n-3) +4*(-n+3)*a(n-4)=0. - R. J. Mathar, Jan 25 2023

A329674 Number of meanders of length n with Motzkin-steps avoiding the consecutive steps DD.

Original entry on oeis.org

1, 2, 5, 13, 34, 90, 240, 643, 1729, 4662, 12597, 34095, 92406, 250719, 680877, 1850457, 5032296, 13692674, 37274438, 101509476, 276535824, 753574253, 2054064713, 5600176231, 15271331416, 41651397245, 113618996429, 309979833301, 845805408448, 2308108658854, 6299205562846
Offset: 0

Views

Author

Valerie Roitner, Nov 26 2019

Keywords

Comments

The Motzkin step set is U=(1,1), H=(1,0) and D=(1,-1). A meander is a path starting at (0,0) and never crossing the x-axis, i.e., staying at nonnegative altitude.

Examples

			a(2)=5 since we have 5 meanders of length 2 avoiding DD, namely UU, UH, UD, HU and HH.

Crossrefs

Cf. A004148 (shifted by 1) which counts excursions avoiding consecutive DD steps.
Cf. A329672 and A329673 which count meanders avoiding consecutive UU or HH respectively.

Formula

G.f.: -(1-3*t-t^2-sqrt(1-2*t-t^2-2*t^3+t^4))/(2*t*(1-2*t-2*t^2)).
D-finite with recurrence (n+1)*a(n) +(-4*n-1)*a(n-1) +(n-2)*a(n-2) +(4*n+1)*a(n-3) +(7*n-23)*a(n-4) +2*(n-2)*a(n-5) +2*(-n+5)*a(n-6)=0. - R. J. Mathar, Jan 25 2023
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.