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!)
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. 3
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, 2451561077995 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,2

LINKS

Table of n, a(n) for n=3..29.

CROSSREFS

First differences of A025180. Second differences of A014531.

Sequence in context: A295913 A272225 A272585 * A054856 A261057 A283456

Adjacent sequences:  A026066 A026067 A026068 * A026070 A026071 A026072

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

a(29) corrected by Sean A. Irvine, Sep 14 2019

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 February 27 21:59 EST 2020. Contains 332312 sequences. (Running on oeis4.)