login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026522 T(n,n-2), T given by A026519. Also number of integer strings s(0),...,s(n), counted by T, such that s(n)=2. 5
1, 2, 5, 13, 27, 76, 150, 434, 845, 2470, 4797, 14085, 27377, 80584, 156900, 462620, 902394, 2664276, 5205950, 15387670, 30114073, 89097932, 174609162, 517058502, 1014555607, 3006637946, 5906040623, 17514547015, 34438443075 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

Table of n, a(n) for n=2..30.

Veronika Irvine, Stephen Melczer, Frank Ruskey, Vertically constrained Motzkin-like paths inspired by bobbin lace, arXiv:1804.08725 [math.CO], 2018.

CROSSREFS

Cf. A026519, A026520, A026521, A026523, A026524.

Sequence in context: A289774 A126656 A272794 * A216378 A225690 A193044

Adjacent sequences:  A026519 A026520 A026521 * A026523 A026524 A026525

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 November 18 12:35 EST 2019. Contains 329261 sequences. (Running on oeis4.)