login

%I #16 Jan 28 2017 13:47:39

%S 1,1,1,2,2,2,3,3,3,3,5,5,5,5,5,8,8,8,8,8,8,13,13,13,13,13,13,13,21,21,

%T 21,21,21,21,21,21,34,34,34,34,34,34,34,34,34,55,55,55,55,55,55,55,55,

%U 55,55,89,89,89,89,89,89,89,89,89,89,89,144,144,144

%N A127647 * A000012.

%C Row sums = A045925, n*Fib(n): (1, 2, 6, 12, 25, 48,...).

%C A104763 = A000012 * A127647.

%H Reinhard Zumkeller, <a href="/A131410/b131410.txt">Rows n = 1..120 of triangle, flattened</a>

%F A127647 * A000012 as infinite lower triangular matrices.

%F Partial sums of A127647 starting from the right, read by rows.

%F By rows, F(n) occurs n times.

%e First few rows of the triangle are:

%e 1;

%e 1, 1;

%e 2, 2, 2;

%e 3, 3, 3, 3;

%e 5, 5, 5, 5, 5;

%e 8, 8, 8, 8, 8, 8;

%e ...

%t Table[Fibonacci[n], {n, 15}, {n}] // Flatten (* _Vincenzo Librandi_, Jan 28 2017 *)

%o (Haskell)

%o a131410 n k = a131410_tabl !! (n-1) !! (n-1)

%o a131410_row n = a131410_tabl !! (n-1)

%o a131410_tabl = zipWith replicate [1..] $ tail a000045_list

%o -- _Reinhard Zumkeller_, Oct 07 2012

%Y Cf. A127647, A045925, A104763, A000045.

%K nonn,tabl

%O 1,4

%A _Gary W. Adamson_, Jul 08 2007