cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A131410 A127647 * A000012.

This page as a plain text file.
%I A131410 #16 Jan 28 2017 13:47:39
%S A131410 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 A131410 21,21,21,21,21,21,34,34,34,34,34,34,34,34,34,55,55,55,55,55,55,55,55,
%U A131410 55,55,89,89,89,89,89,89,89,89,89,89,89,144,144,144
%N A131410 A127647 * A000012.
%C A131410 Row sums = A045925, n*Fib(n): (1, 2, 6, 12, 25, 48,...).
%C A131410 A104763 = A000012 * A127647.
%H A131410 Reinhard Zumkeller, <a href="/A131410/b131410.txt">Rows n = 1..120 of triangle, flattened</a>
%F A131410 A127647 * A000012 as infinite lower triangular matrices.
%F A131410 Partial sums of A127647 starting from the right, read by rows.
%F A131410 By rows, F(n) occurs n times.
%e A131410 First few rows of the triangle are:
%e A131410 1;
%e A131410 1, 1;
%e A131410 2, 2, 2;
%e A131410 3, 3, 3, 3;
%e A131410 5, 5, 5, 5, 5;
%e A131410 8, 8, 8, 8, 8, 8;
%e A131410 ...
%t A131410 Table[Fibonacci[n], {n, 15}, {n}] // Flatten (* _Vincenzo Librandi_, Jan 28 2017 *)
%o A131410 (Haskell)
%o A131410 a131410 n k = a131410_tabl !! (n-1) !! (n-1)
%o A131410 a131410_row n = a131410_tabl !! (n-1)
%o A131410 a131410_tabl = zipWith replicate [1..] $ tail a000045_list
%o A131410 -- _Reinhard Zumkeller_, Oct 07 2012
%Y A131410 Cf. A127647, A045925, A104763, A000045.
%K A131410 nonn,tabl
%O A131410 1,4
%A A131410 _Gary W. Adamson_, Jul 08 2007