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.

Original entry on oeis.org

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, 21, 21, 21, 21, 21, 21, 34, 34, 34, 34, 34, 34, 34, 34, 34, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 144, 144, 144
Offset: 1

Views

Author

Gary W. Adamson, Jul 08 2007

Keywords

Comments

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

Examples

			First few rows of the triangle are:
1;
1, 1;
2, 2, 2;
3, 3, 3, 3;
5, 5, 5, 5, 5;
8, 8, 8, 8, 8, 8;
...
		

Crossrefs

Programs

  • Haskell
    a131410 n k = a131410_tabl !! (n-1) !! (n-1)
    a131410_row n = a131410_tabl !! (n-1)
    a131410_tabl = zipWith replicate [1..] $ tail a000045_list
    -- Reinhard Zumkeller, Oct 07 2012
  • Mathematica
    Table[Fibonacci[n], {n, 15}, {n}] // Flatten (* Vincenzo Librandi, Jan 28 2017 *)

Formula

A127647 * A000012 as infinite lower triangular matrices.
Partial sums of A127647 starting from the right, read by rows.
By rows, F(n) occurs n times.