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.

A112358 The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.

Original entry on oeis.org

1, 1, 2, 1, 5, 4, 1, 9, 18, 8, 1, 14, 51, 54, 16, 1, 20, 115, 215, 145, 32, 1, 27, 225, 650, 750, 363, 64, 1, 35, 399, 1645, 2870, 2310, 868, 128, 1, 44, 658, 3668, 8995, 10724, 6538, 2012, 256, 1, 54, 1026, 7434, 24381, 40257, 35658, 17442, 4563, 512, 1, 65, 1530, 13980, 59115, 129150, 156135, 109020, 44595, 10185, 1024
Offset: 0

Views

Author

Amarnath Murthy, Sep 05 2005

Keywords

Comments

The leading diagonal contains 2^n.

Examples

			Row for n = 3 is 1, (2+3+4), (5+6+7), 8.
Triangle begins:
  1
  1 2
  1 5 4
  1 9 18 8
  1 14 51 54 16
  ...
		

Crossrefs

Programs

Formula

T(n,0) = 1, T(n,k) = C(A008949(n,k)+1, 2) - C(A008949(n,k-1)+1, 2) = C(n,k)*(A008949(n+1,k)+1)/2 for k>0. - Franklin T. Adams-Watters, Sep 27 2006

Extensions

More terms from Amber Reardon (alr5041(AT)psu.edu) and Vincent M. DelPrince (vmd5003(AT)psu.edu), Oct 04 2005