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!)
A026524 a(n) = T(n,n-4), T given by A026519. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=4. 5
1, 3, 9, 28, 65, 201, 430, 1316, 2721, 8259, 16793, 50680, 102102, 306958, 615024, 1844304, 3682545, 11024331, 21963161, 65675764, 130648089, 390374193, 775797750, 2316881892, 4601346295, 13737041045, 27270124455 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,2

LINKS

Table of n, a(n) for n=4..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, A026523.

Sequence in context: A022767 A015638 A032092 * A282081 A022631 A027346

Adjacent sequences:  A026521 A026522 A026523 * A026525 A026526 A026527

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 June 5 09:20 EDT 2020. Contains 334829 sequences. (Running on oeis4.)