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.

A162741 Fibonacci-Pascal triangle; same as Pascal triangle, but beginning another Pascal triangle to the right of each row starting at row 2.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 3, 4, 3, 2, 1, 1, 1, 4, 7, 7, 5, 3, 2, 1, 1, 1, 5, 11, 14, 12, 8, 5, 3, 2, 1, 1, 1, 6, 16, 25, 26, 20, 13, 8, 5, 3, 2, 1, 1, 1, 7, 22, 41, 51, 46, 33, 21, 13, 8, 5, 3, 2, 1, 1, 1, 8, 29, 63, 92, 97, 79, 54, 34, 21, 13, 8, 5, 3, 2, 1, 1
Offset: 1

Views

Author

Mark Dols, Jul 12 2009, Jul 19 2009

Keywords

Comments

Intertwined Pascal-triangles;
the first five rows seen as numbers in decimal representation: row(n) = 110*row(n-1) + 1. - corrected by Reinhard Zumkeller, Jul 16 2013

Examples

			.                                           1
.                                       1,  1, 1
.                                   1,  2,  2, 1, 1
.                               1,  3,  4,  3, 2, 1, 1
.                           1,  4,  7,  7,  5, 3, 2, 1, 1
.                       1,  5, 11, 14, 12,  8, 5, 3, 2, 1, 1
.                   1,  6, 16, 25, 26, 20, 13, 8, 5, 3, 2, 1,1
.               1,  7, 22, 41, 51, 46, 33, 21,13, 8, 5, 3, 2,1,1
.           1,  8, 29, 63, 92, 97, 79, 54, 34,21,13, 8, 5, 3,2,1,1
.       1,  9, 37, 92,155,189,176,133, 88, 55,34,21,13, 8, 5,3,2,1,1
.    1,10, 46,129,247,344,365,309,221,143, 89,55,34,21,13, 8,5,3,2,1,1
. 1,11,56,175,376,591,709,674,530,364,232,144,89,55,34,21,13,8,5,3,2,1,1 .
		

Crossrefs

Cf. A005408 (row length), A000225 (row sums), A000045 (central terms), A007318, A136431.
Cf. A021113. - Mark Dols, Jul 18 2009
Some other Fibonacci-Pascal triangles: A027926, A036355, A037027, A074829, A105809, A109906, A111006, A114197, A228074.

Programs

  • Haskell
    a162741 n k = a162741_tabf !! (n-1) !! (k-1)
    a162741_row n = a162741_tabf !! (n-1)
    a162741_tabf = iterate
       (\row -> zipWith (+) ([0] ++ row ++ [0]) (row ++ [0,1])) [1]
    -- Reinhard Zumkeller, Jul 16 2013
  • Mathematica
    T[, 1] = 1; T[n, k_] /; k == 2*n-2 || k == 2*n-1 = 1; T[n_, k_] := T[n, k] = T[n-1, k-1] + T[n-1, k]; Table[T[n, k], {n, 1, 9}, {k, 1, 2*n-1}] // Flatten (* Jean-François Alcover, Oct 30 2017, after Reinhard Zumkeller *)

Formula

T(n,k) = T(n-1,k-1) + T(n-1,k), T(n,1)=1 and for n>1: T(n,2*n-2) = T(n,2*n-1)=1. - Reinhard Zumkeller, Jul 16 2013