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.

Showing 1-1 of 1 results.

A322062 Sums of pairs of consecutive terms of Pascal's triangle read by row.

Original entry on oeis.org

2, 2, 2, 3, 3, 2, 4, 6, 4, 2, 5, 10, 10, 5, 2, 6, 15, 20, 15, 6, 2, 7, 21, 35, 35, 21, 7, 2, 8, 28, 56, 70, 56, 28, 8, 2, 9, 36, 84, 126, 126, 84, 36, 9, 2, 10, 45, 120, 210, 252, 210, 120, 45, 10, 2, 11, 55, 165, 330, 462, 462, 330, 165, 55, 11, 2, 12, 66, 220, 495, 792, 924, 792, 495, 220, 66, 12, 1
Offset: 0

Views

Author

Kei Ryan, Nov 25 2018

Keywords

Comments

Sums of pairs of adjacent terms of A007318. - N. J. A. Sloane, Jan 27 2019

Examples

			The 8th term is 6 because it is the sum of the 8th and 9th terms of Pascal's triangle read by row (3 + 3).
Triangle begins:
  2;
  2,  2;
  3,  3,  2;
  4,  6,  4,  2;
  5, 10, 10,  5,  2;
  ...
		

Crossrefs

Programs

  • Mathematica
    v = Flatten[Table[Binomial[n, k], {n, 0, 10}, {k, 0, n}]]; Most[v] + Rest[v] (* Amiram Eldar, Nov 25 2018 *)
  • PARI
    T(n, k) = if (kMichel Marcus, Nov 25 2018

Formula

T(n, k) = if (kMichel Marcus, Nov 25 2018
Showing 1-1 of 1 results.