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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026524 a(n) = T(n,n-4), T given by A026519. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=4. 0
1, 3, 9, 28, 65, 201, 430, 1316, 2721, 8259, 16793, 50680, 102102, 306958, 615024, 1844304, 3682545, 11024331, 21963161, 65675764, 130648089, 390374193, 775797750, 2316881892, 4601346295, 13737041045, 27270124455 (list; graph; refs; listen; history; internal format)
OFFSET

4,2

CROSSREFS

Sequence in context: A022767 A015638 A032092 * A022631 A027346 A047134

Adjacent sequences:  A026521 A026522 A026523 * A026525 A026526 A026527

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 17 09:41 EST 2012. Contains 206009 sequences.