%I A156319
%S A156319 1,2,1,0,2,1,0,0,2,1,0,0,0,2,1,0,0,0,0,2,1,0,0,0,0,0,2,1,0,0,0,0,0,0,2,
%T A156319 1,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,0,0,2,1
%N A156319 Triangle by columns: (1, 2, 0, 0, 0,...) in every column.
%C A156319 Binomial transform of the triangle = A110813.
%C A156319 Eigensequence of the triangle = A001045
%C A156319 Inverse = a triangle with (1, -2, 4, -8, 16,...) in every column.
%C A156319 Triangle T(n,k), 0<=k<=n, given by [2,-2,0,0,0,0,0,0,...] DELTA [1,0,
               0,0,0,0,0,0,...] where DELTA is the operator defined in A084938 . 
               [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Feb 08 2009]
%F A156319 Triangle read by rows, T(n,k) = 1 if (n = k); 2 if k = n-1, 0 otherwise.
%F A156319 By columns, (1, 2, 0, 0, 0,...) in every column.
%F A156319 T(n,k)=A097806(n,k)*2^(n-k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Feb 08 2009]
%e A156319 First few rows of the triangle =
%e A156319 1;
%e A156319 2, 1;
%e A156319 0, 2, 1;
%e A156319 0, 0, 2, 1;
%e A156319 0, 0, 0, 2, 1;
%e A156319 0, 0, 0, 0, 2, 1;
%e A156319 0, 0, 0, 0, 0, 2, 1;
%e A156319 0, 0, 0, 0, 0, 0, 2, 1;
%e A156319 0, 0, 0, 0, 0, 0, 0, 2, 1;
%e A156319 ...
%Y A156319 Cf. A110813, A001045
%Y A156319 Sequence in context: A067613 A058531 A093073 this_sequence A083650 A030204 
               A138514
%Y A156319 Adjacent sequences: A156316 A156317 A156318 this_sequence A156320 A156321 
               A156322
%K A156319 nonn,tabl
%O A156319 1,2
%A A156319 Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 07 2009