Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026085
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026085 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,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A026082. +0
1
4, 8, 27, 76, 226, 660, 1939, 5688, 16704, 49072, 144254, 424296, 1248728, 3677184, 10834416, 31939584, 94205772, 277997400, 820747275, 2424232956, 7163519202, 21176638868, 62626464319, 185276853192, 548326714720, 1623325361424 (list; graph; listen)
OFFSET

4,1

CROSSREFS

First differences of A026069.

Sequence in context: A012952 A100411 A065405 this_sequence A036720 A110132 A099513

Adjacent sequences: A026082 A026083 A026084 this_sequence A026086 A026087 A026088

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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research