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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026389 a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=4; also a(n) = T(2n,n-2). 1
1, 8, 49, 272, 1440, 7428, 37730, 189808, 948909, 4724160, 23453001, 116207424, 575036475, 2842936320, 14046869575, 69378730880, 342590699955, 1691519468760, 8351553940355, 41235710124400, 203617691311370, 1005560117623204 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

COMMENTS

Binomial transform of A002694. - Ross La Haye (rlahaye(AT)new.rr.com), Mar 05 2005

CROSSREFS

Sequence in context: A018200 A166789 A081901 * A005059 A026719 A026774

Adjacent sequences:  A026386 A026387 A026388 * A026390 A026391 A026392

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 08:34 EST 2012. Contains 205998 sequences.