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.

A164847 (100^n,1) Pascal triangle.

Original entry on oeis.org

1, 100, 1, 10000, 101, 1, 1000000, 10101, 102, 1, 100000000, 1010101, 10203, 103, 1, 10000000000, 101010101, 1020304, 10306, 104, 1, 1000000000000, 10101010101, 102030405, 1030610, 10410, 105, 1, 100000000000000, 1010101010101
Offset: 0

Views

Author

Mark Dols, Aug 28 2009

Keywords

Comments

(For row n=0,1,2,3,4,5 : Sum of digits = Pascal triangle)

Examples

			Triangle begins:
1
100,1
10000,101,1
1000000,10101,102,1
100000000,1010101,10203,103,1
10000000000,101010101,1020304,10306,104,1
1000000000000,10101010101,102030405,1030610,10410,105,1
100000000000000,1010101010101,10203040506,103061015,1041020,10515,106,1
10000000000000000,101010101010101,1020304050607,10306101521,104102035,1051535,10621,107,1,
		

Crossrefs

Formula

T(n,0)=100^n, T(n,n)=1, T(n,k)=T(n-1,k-1)+T(n-1,k) for 0Philippe Deléham, Dec 27 2013
T(n,k)=101*T(n-1,k)+T(n-1,k-1)-100*T(n-2,k)-100*T(n-2,k-1), T(0,0)=1, T(1,0)=100, T(1,1)=1, T(n,k)=0 if k<0 or if k>n. - Philippe Deléham, Dec 27 2013