Search: id:A108561
Results 1-1 of 1 results found.

%I A108561
%S A108561 1,1,1,1,0,1,1,1,1,1,1,2,2,0,1,1,3,4,2,1,1,1,4,7,6,3,0,1,1,5,11,13,9,3,
               1,1,1,6,16,
%T A108561 24,22,12,4,0,1,1,7,22,40,46,34,16,4,1,1,1,8,29,62,86,80,50,20,5,0,1,1,
               9,37,91,148,
%U A108561 166,130,70,25,5,1,1,1,10,46,128,239,314,296,200,95,30,6,0,1,1,11,56,174,
               367
%V A108561 1,1,-1,1,0,1,1,1,1,-1,1,2,2,0,1,1,3,4,2,1,-1,1,4,7,6,3,0,1,1,5,11,13,
               9,3,1,-1,1,6,16,
%W A108561 24,22,12,4,0,1,1,7,22,40,46,34,16,4,1,-1,1,8,29,62,86,80,50,20,5,0,1,
               1,9,37,91,148,
%X A108561 166,130,70,25,5,1,-1,1,10,46,128,239,314,296,200,95,30,6,0,1,1,11,56,
               174,367
%N A108561 Triangle read by rows: T(n,0)=1, T(n,n)=(-1)^floor(n/2), T(n+1,k)=T(n,
               k-1)+T(n,k) for 0<k<n.
%C A108561 Sum(T(n,k): 0<=k<=n) = A078008(n);
%C A108561 Sum(abs(T(n,k)): 0<=k<=n) = A052953(n-1) for n>0;
%C A108561 T(n,1) = n - 2 for n>1;
%C A108561 T(n,2) = A000124(n-3) for n>2;
%C A108561 T(n,3) = A003600(n-4) for n>4;
%C A108561 T(n,n-6) = A001753(n-6) for n>6;
%C A108561 T(n,n-5) = A001752(n-5) for n>5;
%C A108561 T(n,n-4) = A002623(n-4) for n>4;
%C A108561 T(n,n-3) = A002620(n-1) for n>3;
%C A108561 T(n,n-2) = A008619(n-2) for n>2;
%C A108561 T(n,n-1) = n mod 2 for n>0;
%C A108561 T(2*n,n) = A072547(n+1).
%H A108561 <a href="Sindx_Pas.html#Pascal">Index entries for triangles and arrays 
               related to Pascal's triangle</a>
%Y A108561 Cf. A007318.
%Y A108561 Similar to the triangles A035317, A059259, A080242, A112555.
%Y A108561 Sequence in context: A113414 A112185 A112555 this_sequence A104579 A079531 
               A134178
%Y A108561 Adjacent sequences: A108558 A108559 A108560 this_sequence A108562 A108563 
               A108564
%K A108561 sign,tabl
%O A108561 0,12
%A A108561 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 10 2005

Search completed in 0.002 seconds