%I A144152
%S A144152 1,0,1,1,0,1,0,1,0,2,1,0,1,0,3,0,1,0,2,0,5,1,0,1,0,3,0,8,0,1,0,2,0,5,0,
%T A144152 13,1,0,1,0,3,0,8,0,21,0,1,0,2,0,0,5,0,13,0,34,1,0,1,0,3,0,8,0,21,0,55
%N A144152 Eigentriangle, row sums = Fibonacci numbers.
%C A144152 Even n rows are composed of odd indexed Fibonacci numbers interpolated 
               with zeros.
%C A144152 Odd n rows are composed of even indexed Fibonacci numbers with alternate 
               zeros. Sum of n-th row terms = rightmost term of next row, = F(n-1). 
               Row sums = F(n).
%F A144152 Triangle read by rows, A128174 * X; X = an infinite lower triangular 
               matrix with a shifted Fibonacci sequence: (1, 1, 1, 2, 3, 5, 8,...) 
               in the main diagonal and the rest zeros. A128174 = the matrix: (1; 
               0,1; 1,0,1; 0,1,0,1;...). These operations are equivalent to termwise 
               products of n terms of A128174 mattrix row terms and an equal number 
               of terms in (1, 1, 1, 2, 3, 5, 8,...).
%e A144152 First few rows of the triangle =
%e A144152 1;
%e A144152 0, 1;
%e A144152 1, 0, 1;
%e A144152 0, 1, 0, 2;
%e A144152 1, 0, 1, 0, 3
%e A144152 0, 1, 0, 2, 0, 5;
%e A144152 1, 0, 1, 0, 3, 0, 8;
%e A144152 0, 1, 0, 2, 0, 5, 0, 13;
%e A144152 1, 0, 1, 0, 3, 0, 8, 0, 21;
%e A144152 ...
%e A144152 Row 5 = (1, 0, 1, 0, 3) = termwise products of (1, 0, 1, 0, 1) and (1, 
               1, 1, 2, 3).
%Y A144152 A000045, Cf. A128174
%Y A144152 Sequence in context: A156256 A029406 A158461 this_sequence A116675 A123022 
               A072943
%Y A144152 Adjacent sequences: A144149 A144150 A144151 this_sequence A144153 A144154 
               A144155
%K A144152 nonn
%O A144152 1,10
%A A144152 Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 12 2008