Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026109
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026109 a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-3), where T is the array defined in A026105. +0
3
1, 3, 10, 30, 89, 259, 748, 2148, 6150, 17578, 50204, 143364, 409500, 1170300, 3346944, 9579840, 27444681, 78698475, 225887010, 648985414, 1866356437, 5372348487, 15478733108, 44637360700, 128837626255, 372183158061, 1076041247778 (list; graph; listen)
OFFSET

3,2

FORMULA

G.f.: z(1-z)M^4, with M the g.f. of the Motzkin numbers (A001006).

CROSSREFS

First differences of A005323. Cf. A026124.

Adjacent sequences: A026106 A026107 A026108 this_sequence A026110 A026111 A026112

Sequence in context: A027205 A026937 A094306 this_sequence A026327 A014531 A062107

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research