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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026388 a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=2; also a(n) = T(2n,n-1). 1
1, 5, 24, 114, 541, 2573, 12275, 58747, 282003, 1357407, 6549906, 31675020, 153481299, 745011075, 3622111560, 17635418730, 85975792075, 419644943495, 2050493623760, 10029194506990, 49098707209695, 240568930012575 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Sequence in context: A079028 A141223 A140766 * A057969 A004254 A086347

Adjacent sequences:  A026385 A026386 A026387 * A026389 A026390 A026391

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 23:38 EST 2012. Contains 206085 sequences.