Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119258
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A119258
%S A119258 1,1,1,1,3,1,1,5,7,1,1,7,17,15,1,1,9,31,49,31,1,1,11,49,111,129,63,1,1,
%T A119258 13,71,209,351,321,127,1,1,15,97,351,769,1023,769,255,1,1,17,127,545,
%U A119258 1471,2561,2815,1793,511,1,1,19,161,799,2561,5503,7937,7423,4097,1023,
               1
%N A119258 Triangle read by rows: T(n,0)=T(n,n)= 1 and for 0<k<n: T(n,k)=2*T(n-1,
               k-1)+T(n-1,k).
%C A119258 T(2*n,n-1) = T(2*n-1,n) for n>0;
%C A119258 central terms give A119259; row sums give A007051;
%C A119258 T(n,0) = T(n,n) = 1;
%C A119258 T(n,1) = A005408(n-1) for n>0;
%C A119258 T(n,2) = A056220(n-1) for n>1;
%C A119258 T(n,n-4) = A027608(n-4) for n>3;
%C A119258 T(n,n-3) = A055580(n-3) for n>2;
%C A119258 T(n,n-2) = A000337(n-1) for n>1;
%C A119258 T(n,n-1) = A000225(n) for n>0.
%H A119258 <a href="Sindx_Pas.html#Pascal">Index entries for triangles and arrays 
               related to Pascal's triangle</a>
%F A119258 T(n,k)=[k<=n]*(-1)^k*sum{i=0..k, (-1)^i*C(k-n,k-i)*C(n,i)}; - Paul Barry 
               (pbarry(AT)wit.ie), Sep 28 2007
%Y A119258 Cf. A007318.
%Y A119258 Sequence in context: A121522 A080842 A145661 this_sequence A099608 A047969 
               A047812
%Y A119258 Adjacent sequences: A119255 A119256 A119257 this_sequence A119259 A119260 
               A119261
%K A119258 nonn,tabl
%O A119258 0,5
%A A119258 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 11 2006

    
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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research