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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026523 a(n) = T(n,n-3), T given by A026519. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=3. 5
1, 2, 8, 16, 52, 104, 319, 635, 1910, 3786, 11304, 22344, 66514, 131264, 390266, 769578, 2286996, 4508580, 13397075, 26412001, 78489235, 154773696, 460030947, 907432695, 2697786052, 5323519838, 15830906756, 31251588060 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,2

LINKS

Table of n, a(n) for n=3..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, A026522, A026524.

Sequence in context: A076508 A162584 A100243 * A066792 A096195 A094014

Adjacent sequences:  A026520 A026521 A026522 * A026524 A026525 A026526

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 13 23:48 EST 2019. Contains 329106 sequences. (Running on oeis4.)