Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026069
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026069 a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A024996. +0
4
1, 5, 13, 40, 116, 342, 1002, 2941, 8629, 25333, 74405, 218659, 642955, 1891683, 5568867, 16403283, 48342867, 142548639, 420546039, 1241293314, 3665526270, 10829045472, 32005684340, 94632148659, 279909001851, 828235716571, 2351561077995 (list; graph; listen)
OFFSET

3,2

CROSSREFS

First differences of A025180. Second differences of A014531.

Sequence in context: A129924 A080143 A077919 this_sequence A054856 A121872 A025490

Adjacent sequences: A026066 A026067 A026068 this_sequence A026070 A026071 A026072

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research