Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026933
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A026933
%S A026933 1,2,11,52,269,1414,7575,41064,224665,1237898,6859555,38187164,
%T A026933 213408805,1196524814,6727323439,37915058384,214140178225,1211694546194,
%U A026933 6867622511675,38981807403268,221562006394173,1260814207833750
%N A026933 a(n) = self-convolution of array T given by A008288.
%F A026933 G.f.: 1/(1+x)/sqrt(1-6*x+x^2). - Vladeta Jovovic (vladeta(AT)eunet.rs), 
               May 13 2003
%F A026933 a(n)=(-1)^n*sum_{k=0...n}(-1)^k*A001850(k) - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Sep 28 2005
%Y A026933 Sequence in context: A026996 A110308 A027201 this_sequence A052171 A030281 
               A063767
%Y A026933 Adjacent sequences: A026930 A026931 A026932 this_sequence A026934 A026935 
               A026936
%K A026933 nonn
%O A026933 0,2
%A A026933 Clark Kimberling (ck6(AT)evansville.edu)
%E A026933 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), May 13 2003

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research