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-3 of 3 results.

A223968 Square array T, read by antidiagonals: T(n,k) = 0 if n-k >= 5 or if k-n >= 6, T(4,0) = T(3,0) = T(2,0) = T(1,0) = T(0,0) = T(0,1) = T(0,2) = T(0,3) = T(0,4) = T(0,5) = 1, T(n,k) = T(n-1,k) + T(n,k-1).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 5, 10, 10, 5, 0, 0, 6, 15, 20, 15, 5, 0, 0, 6, 21, 35, 35, 20, 0, 0, 0, 0, 27, 56, 70, 55, 20, 0, 0, 0, 0, 27, 83, 126, 125, 75, 0, 0, 0, 0, 0, 0, 110, 209, 251, 200, 75, 0, 0, 0, 0, 0, 0, 110, 319, 460, 451, 275, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Philippe Deléham, Mar 30 2013

Keywords

Examples

			Square array begins:
1....1....1....1....1....1....0....0....0....0....0....0
1....2....3....4....5....6....6....0....0....0....0....0
1....3....6...10...15...21...27...27....0....0....0....0
1....4...10...20...35...56...83..110..110....0....0....0
1....5...15...35...70..126..209..319..429..429....0....0
0....5...20...55..125..251..460..779.1208.1637.1637....0
0....0...20...75..200..451..911.1690.2898.4535.6172.6172
...
Square array, read by diagonals, with 0 omitted:
1, 5, 20, 75, 275, 1001, 3639, 13243, 48280, ...
1, 5, 20, 75, 275, 1001, 3639, 13243, 48280, ...
1, 4, 15, 55, 200, 726, 2638, 9604, 35037, ...
1, 3, 10, 35, 125, 451, 1637, 5965, 21794, ...
1, 2, 6, 20, 70, 251, 911, 3327, 12190, 44744, ...
1, 3, 10, 35, 126, 460, 1690, 6225, 22950, ...
1, 4, 15, 56, 209, 779, 2898, 10760, 39882, ...
1, 5, 21, 83, 319, 1208, 4535, 16932, 62986, ...
1, 6, 27, 110, 429, 1637, 6172, 23104, 86090, ...
1, 6, 27, 110, 429, 1637, 6172, 23104, 86090, ...
		

Crossrefs

Formula

sum(T(n-k,k), 0<=k<=n) = A223940(n).
T(n,n+5) = T(n,n+4) = A221863(n).
T(n,n+3) = A221862(n).
T(n,n+2) = A221859(n).
T(n,n+1) = A216710(n).
T(n,n) = A224514(n).
T(n+1,n) = A224509(n).
T(n+2,n) = A220948(n).
T(n+3,n) = T(n+4,n) = A224422(n). - Philippe Deléham, Apr 13 2013

A217770 Square array T, read by antidiagonals: T(n,k) = 0 if n-k >=4 or if k-n >= 6, T(3,0) = T(2,0) = T(1,0) = T(0,0) = T(0,1) = T(0,2) = T(0,3) = T(0,4) = T(0,5) = 1, T(n,k) = T(n-1,k) + T(n,k-1).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 0, 1, 5, 10, 10, 4, 0, 0, 6, 15, 20, 14, 0, 0, 0, 6, 21, 35, 34, 14, 0, 0, 0, 0, 27, 56, 69, 48, 0, 0, 0, 0, 0, 27, 83, 125, 117, 48, 0, 0, 0, 0, 0, 0, 110, 208, 242, 165, 0, 0, 0, 0, 0, 0, 0, 110, 318, 450, 407, 165
Offset: 0

Views

Author

Philippe Deléham, Mar 24 2013

Keywords

Comments

A hexagon arithmetic of E. Lucas.

Examples

			Square array begins:
n=0: 1, 1,  1,  1,   1,   1,   0,   0,    0,    0,    0, 0, ...
n=1: 1, 2,  3,  4,   5,   6,   6,   0,    0,    0,    0, 0, ...
n=2: 1, 3,  6, 10,  15,  21,  27,  27,    0,    0,    0, 0, ...
n=3: 1, 4, 10, 20,  35,  56,  83, 110,  110,    0,    0, 0, ...
n=4: 0, 4, 14, 34,  69, 125, 208, 318,  428,  428,    0, 0, ...
n=5: 0, 0, 14, 48, 117, 242, 450, 768, 1196, 1624, 1624, 0, ...
...
Square array, read by rows, with 0 omitted:
...1,    1,     1,     1,     1,      1
...1,    2,     3,     4,     5,      6,      6
...1,    3,     6,    10,    15,     21,     27,     27
...1,    4,    10,    20,    35,     56,     83,    110,    110
...4,   14,    34,    69,   125,    208,    318,    428,    428
..14,   48,   117,   242,   450,    768,   1196,   1624,   1624
..48,  165,   407,   857,  1625,   2821,   4445,   6069,   6069
.165,  572,  1429,  3054,  5875,  10320,  16389,  22458,  22458
.572, 2001,  5055, 10930, 21250,  37639,  60097,  82555,  82555
2001, 7056, 17986, 39236, 76875, 136972, 219527, 302082, 302082
...
Triangle begins:
1
1, 1
1, 2,  1
1, 3,  3,  1
1, 4,  6,  4,  0
1, 5, 10, 10,  4,  0
0, 6, 15, 20, 14,  0, 0
0, 6, 21, 35, 34, 14, 0, 0
...
		

Crossrefs

Formula

T(n,n+4) = T(n,n+5) = A094788(n+2).
T(n,n+3) = A217783(n).
T(n,n+2) = A217779(n).
T(n,n+1) = A081567(n).
T(n,n) = A217782(n).
T(n+1,n) = A217778(n).
T(n+3,n) = T(n+2,n) = A094667(n+1).
Sum(T(n-k,k), k=0..n) = A217777(n).

A217315 Square array T, read by antidiagonals: T(n,k) = 0 if n-k >= 1 or if k-n >= 8, T(0,k)= 1 if 0<=k<=7, T(n,k) = T(n-1,k) + T(n,k-1).

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 2, 0, 0, 1, 4, 5, 0, 0, 0, 1, 5, 9, 5, 0, 0, 0, 1, 6, 14, 14, 0, 0, 0, 0, 0, 7, 20, 28, 14, 0, 0, 0, 0, 0, 7, 27, 48, 42, 0, 0, 0, 0, 0, 0, 0, 34, 75, 90, 42, 0, 0, 0, 0, 0, 0, 0, 34, 109, 165, 132, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 274, 297, 132, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 417, 571, 429, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Philippe Deléham, Mar 17 2013

Keywords

Comments

A hexagon arithmetic of E. Lucas.

Examples

			Square array begins:
1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, ... row n=0
0, 1, 2, 3, 4, 5, 6, 7, 7, 0, 0, 0, 0, 0, 0, ... row n=1
0, 0, 2, 5, 9, 14, 20, 27, 34, 34, 0, 0, 0, ... row n=2
0, 0, 0, 5, 14, 28, 48, 75, 109, 143, 143, 0, 0, ... row n=3
0, 0, 0, 0, 14, 42, 90, 165, 274, 417, 560, 560, 0, ... row n=4
0, 0, 0, 0, 0, 42, 132, 297, 571, 988, 1548, 2108, 2108, 0, ... row n=5
...
		

Crossrefs

Cf. Similar sequence: A216230, A216228, A216226, A216238, A216054, A217257.

Programs

  • Mathematica
    t[0, k_ /; k <= 7] = 1; t[n_, k_] /; k < n || k > n+7 = 0; t[n_, k_] := t[n, k] = t[n-1, k] + t[n, k-1]; Table[t[n-k, k], {n, 0, 13}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Mar 18 2013 *)

Formula

T(n,n) = A080938(n).
T(n,n+1) = A080938(n+1).
T(n,n+2) = A094826(n+1).
T(n,n+3) = A094827(n+1).
T(n,n+4) = A094828(n+2).
T(n,n+5) = A094829(n+2).
T(n,n+6) = T(n,n+7) = A094256(n+1).
Sum_{k, 0<=k<=n} T(n-k,k) = A061551(n).
Showing 1-3 of 3 results.