Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Oct 13 2012 21:00:19
%S 0,1,1,1,1,1,1,1,1,2,1,1,1,1,3,1,1,1,1,1,5,1,1,1,1,1,1,8,1,1,1,1,1,1,
%T 1,13,1,1,1,1,1,1,1,1,21,1,1,1,1,1,1,1,1,1,34,1,1,1,1,1,1,1,1,1,1,55
%N Triangular sequence: The Fibonacci sequence on the diagonal, 1's at all other places
%F t(n,m)=If[n == m, Fibonacci[n], 1].
%e 0;
%e 1, 1;
%e 1, 1, 1;
%e 1, 1, 1, 2;
%e 1, 1, 1, 1, 3;
%e 1, 1, 1, 1, 1, 5;
%e 1, 1, 1, 1, 1, 1, 8;
%e 1, 1, 1, 1, 1, 1, 1, 13;
%e 1, 1, 1, 1, 1, 1, 1, 1, 21;
%e 1, 1, 1, 1, 1, 1, 1, 1, 1, 34;
%e 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 55;
%t Table[Table[If[n == m, Fibonacci[n], 1], {n, 0, m}], {m, 0, 10}]; Flatten[%] Table[Apply[Plus, Table[If[n == m, Fibonacci[n], 1], {n, 0, m}]], {m, 0, 10}];
%Y Cf. A130296, A002062 (row sums)
%K nonn,tabl,easy
%O 1,10
%A _Roger L. Bagula_ and _Gary W. Adamson_, Apr 28 2008