Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026288
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026288 Number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 2, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-2), where T is the array in A026268. +0
1
1, 2, 5, 14, 38, 104, 285, 784, 2164, 5994, 16658, 46442, 129868, 364182, 1023960, 2886174, 8153952, 23086374, 65497653, 186175794, 530148414, 1512174076, 4320093569, 12360382436, 35414530188, 101603373430, 291864076387, 839402336610 (list; graph; listen)
OFFSET

2,2

FORMULA

G.f.: 8z^2(1-z)(1-z^2)/[1-z+sqrt(1-2z-3z^2)]^3.

CROSSREFS

Pairwise sums of A026123.

Sequence in context: A084085 A052985 A052945 this_sequence A047086 A006574 A053419

Adjacent sequences: A026285 A026286 A026287 this_sequence A026289 A026290 A026291

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research