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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026386 Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and 1<=k<=n-1, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and 1<=k<=n-1. 16
1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 5, 8, 5, 1, 1, 7, 17, 17, 7, 1, 1, 8, 24, 34, 24, 8, 1, 1, 10, 39, 75, 75, 39, 10, 1, 1, 11, 49, 114, 150, 114, 49, 11, 1, 1, 13, 70, 202, 339, 339, 202, 70, 13, 1, 1, 14, 83, 272, 541, 678, 541, 272, 83, 14, 1, 1, 16 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,5

FORMULA

T(n, k) = number of integer strings s(0), ..., s(n) such that s(0) = 0, s(n) = n-2k, where, for 1<=i<=n, s(i) is odd if i is odd and |s(i)-s(i-1)|<=1.

CROSSREFS

Sequence in context: A156609 A026637 A026659 * A147532 A156580 A157528

Adjacent sequences:  A026383 A026384 A026385 * A026387 A026388 A026389

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 16:51 EST 2012. Contains 205938 sequences.