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
%I A026387
%S A026387 2,8,34,150,678,3116,14494,68032,321590,1528776,7301142,35003238,
%T A026387 168359754,812041860,3926147730,19022666310,92338836390,448968093320,
%U A026387 2186194166950,10659569748370,52037098259090,254308709196660
%N 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).
%Y A026387 Cf. A026378.
%Y A026387 Sequence in context: A034999 A067336 A151829 this_sequence A085362 A150889 
               A150890
%Y A026387 Adjacent sequences: A026384 A026385 A026386 this_sequence A026388 A026389 
               A026390
%K A026387 nonn
%O A026387 0,1
%A A026387 Clark Kimberling (ck6(AT)evansville.edu)

    
page 1

Search completed in 0.001 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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research