login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026538 a(n)=T(n,n-1), T given by A026536. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=1. 0
1, 1, 3, 6, 13, 33, 65, 180, 346, 990, 1897, 5502, 10571, 30863, 59523, 174456, 337672, 992304, 1926650, 5673140, 11043858, 32571858, 63548069, 187675644, 366849016, 1084649644, 2123604927, 6284986554, 12322549765, 36501029265 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

CROSSREFS

Sequence in context: A018014 A162483 A179928 * A201951 A104448 A062466

Adjacent sequences:  A026535 A026536 A026537 * A026539 A026540 A026541

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 14:32 EST 2012. Contains 205816 sequences.