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

A297498 Right edge of triangle A297497.

Original entry on oeis.org

0, 1, 3, 7, 16, 38, 90, 205, 448, 958, 2053, 4469, 9865, 21849, 48061, 104528, 225121, 482604, 1035645, 2232465, 4834839, 10493118, 22741212, 49074143, 105310104, 224848260, 478534828, 1017589272, 2166420555, 4622251945, 9880423145, 21130501775, 45125126211
Offset: 0

Views

Author

N. J. A. Sloane, Dec 31 2017

Keywords

Crossrefs

Cf. A297497.

Extensions

Terms a(7) and beyond from Lars Blomberg, Jan 01 2018

A297187 Row sums of triangle A297497.

Original entry on oeis.org

0, 2, 6, 14, 35, 89, 203, 444, 951, 2051, 4466, 9860, 21840, 48045, 104525, 225116, 482596, 1035632, 2232443, 4834801, 10493117, 22741208, 49074134, 105310087, 224848230, 478534776, 1017589182, 2166420553, 4622251942, 9880423138, 21130501759, 45125126178
Offset: 0

Views

Author

N. J. A. Sloane, Dec 31 2017

Keywords

Crossrefs

Cf. A297497.

Extensions

Terms a(7) and beyond from Lars Blomberg, Jan 01 2018

A297495 Triangle T(n,k) (n>=0, 0<=k<=n) read by rows: use T(n,k)=T(n,k-1)+T(n-1,k-1) rule except left edge is the sequence read by rows, initial values are T(0,0)=T(1,0)=1.

Original entry on oeis.org

1, 1, 2, 2, 3, 5, 2, 4, 7, 12, 3, 5, 9, 16, 28, 5, 8, 13, 22, 38, 66, 2, 7, 15, 28, 50, 88, 154, 4, 6, 13, 28, 56, 106, 194, 348, 7, 11, 17, 30, 58, 114, 220, 414, 762, 12, 19, 30, 47, 77, 135, 249, 469, 883, 1645, 3, 15, 34, 64, 111, 188, 323, 572, 1041, 1924
Offset: 0

Views

Author

N. J. A. Sloane, Dec 31 2017

Keywords

Comments

Suggested by A297359.

Examples

			Triangle begins:
1,
1,2,
2,3,5,
2,4,7,12,
3,5,9,16,28,
5,8,13,22,38,66,
2,7,15,28,50,88,154,
4,6,13,28,56,106,194,348,
7,11,17,30,58,114,220,414,762,
12,19,30,47,77,135,249,469,883,1645,
3,15,34,64,111,188,323,572,1041,1924,3569,
5,8,23,57,121,232,420,743,1315,2356,4280,7849,
9,14,22,45,102,223,455,875,1618,2933,5289,9569,17418,
16,25,39,61,106,208,431,886,1761,3379,6312,11601,21170,38588,
28,44,69,108,169,275,483,914,1800,3561,6940,13252,24853,46023,84611,
...,
		

Crossrefs

Cf. A297359, A297496 (right edge), A297497, A297498, A297186 (row sums).

Extensions

Terms a(21) and beyond from Lars Blomberg, Jan 01 2018

A297359 Array read by antidiagonals: Pascal-like recursion and self-referential boundaries.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 2, 4, 6, 4, 2, 1, 6, 10, 10, 6, 1, 1, 7, 16, 20, 16, 7, 1, 3, 8, 23, 36, 36, 23, 8, 3, 3, 11, 31, 59, 72, 59, 31, 11, 3, 1, 14, 42, 90, 131, 131, 90, 42, 14, 1, 2, 15, 56, 132, 221, 262, 221, 132, 56, 15, 2, 4, 17, 71, 188, 353, 483, 483, 353, 188, 71, 17, 4, 6, 21, 88, 259, 541, 836, 966, 836, 541, 259
Offset: 1

Views

Author

Alex Meiburg, Dec 29 2017

Keywords

Comments

Array with recursion T(i,j) = T(i-1,j) + T(i,j-1), and boundaries T(0,n) = T(n,0) = a(n). Here a(n) is the array T read by antidiagonals. Require that a(0)=a(1)=1.

Examples

			The array looks like
  1,  1,  1,   1,   2,    1,    1,    3,    3,   1,   2, ...
  1,  2,  3,   4,   6,    7,    8,   11,   14,  15,  17, ...
  1,  3,  6,  10,  16,   23,   31,   42,   56,  71,  88, ...
  1,  4, 10,  20,  36,   59,   90,  132,  188, 259, 347, ...
  2,  6, 16,  36,  72,  131,  221,  353,  541, 800, ...
  1,  7, 23,  59, 131,  262,  483,  836, 1377, ...
  1,  8, 31,  90, 221,  483,  966, 1802,  ...
  3, 11, 42, 132, 353,  836, 1802,  ...
  3, 14, 56, 188, 541, 1377,  ...
  1, 15, 71, 259, 800,  ...
  2, 17, 88, 347, ...
... [Table corrected and reformatted by _Jon E. Schoenfield_, Jan 14 2018]
The defining property is that when this array is read by antidiagonals we get 1,1,1,1,2,1,... which is both the sequence itself and the top row and first column of the array.
		

Crossrefs

See also A007318, A297495, A297497, A297188 (antidiagonal sums).

Programs

  • Mathematica
    t[a_, b_] := (t[a, b] = t[a, b - 1] + t[a - 1, b]);
    t[0, x_] := a[x]; t[x_, 0] := a[x];
    a[0] = 1; a[1] = 1;
    a[x_] := With[{k = Floor[(Sqrt[8 x + 1] - 1)/2]},
      t[x - k (k + 1)/2, (k + 1) (k + 2)/2 - x - 1]]
    a /@ Range[60]
    TableForm[ Table[t[i, j], {i, 0, 5}, {j, 0, 12}]]
Showing 1-4 of 4 results.