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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026521 a(n) = T(n,n-1), T given by A026519. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=1. 1
1, 1, 4, 6, 19, 33, 98, 180, 526, 990, 2887, 5502, 16073, 30863, 90386, 174456, 512128, 992304, 2918954, 5673140, 16716998, 32571858, 96119927, 187675644, 554524660, 1084649644, 3208254571, 6284986554, 18607536319, 36501029265 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

CROSSREFS

Cf. A026537(n+1)/2.

Sequence in context: A024874 A095383 A116383 * A202618 A006534 A064035

Adjacent sequences:  A026518 A026519 A026520 * A026522 A026523 A026524

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 05:45 EST 2012. Contains 205694 sequences.