Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026387
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026387 a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=0; also a(n) = T(2n,n). +0
3
2, 8, 34, 150, 678, 3116, 14494, 68032, 321590, 1528776, 7301142, 35003238, 168359754, 812041860, 3926147730, 19022666310, 92338836390, 448968093320, 2186194166950, 10659569748370, 52037098259090, 254308709196660 (list; graph; listen)
OFFSET

0,1
CROSSREFS

Cf. A026378.

Sequence in context: A113440 A034999 A067336 this_sequence A085362 A074606 A002928

Adjacent sequences: A026384 A026385 A026386 this_sequence A026388 A026389 A026390

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 02:12 EDT 2008. Contains 142294 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.