Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026070 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) = 3. Also a(n) = T(n,n-3), where T is the array defined in A024996. +0
4
1, 2, 8, 24, 76, 232, 707, 2136, 6429, 19282, 57695, 172316, 513955, 1531362, 4559271, 13566288, 40349619, 119972214, 356634978, 1059985776, 3150165270, 9361450868, 27819215185, 82670528056, 245680350995, 730149455646, 2170105711452 (list; graph; listen)
OFFSET

3,2

CROSSREFS

First differences of A025181. Second differences of A014532.

Sequence in context: A131569 A066973 A130495 this_sequence A093833 A006952 A034741

Adjacent sequences: A026067 A026068 A026069 this_sequence A026071 A026072 A026073

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research