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.

A359574 Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected and a path of 1's from top row to bottom row.

Original entry on oeis.org

1, 3, 1, 6, 7, 1, 10, 28, 17, 1, 15, 88, 144, 41, 1, 21, 245, 920, 730, 99, 1, 28, 639, 5191, 9362, 3692, 239, 1, 36, 1608, 27651, 104989, 94280, 18666, 577, 1, 45, 3968, 143342, 1111283, 2075271, 947760, 94384, 1393, 1, 55, 9689, 733512, 11457514, 42972329, 40792921, 9528128, 477264, 3363, 1
Offset: 1

Views

Author

Andrew Howroyd, Jan 06 2023

Keywords

Comments

The grid has m rows and n columns.

Examples

			Array begins:
================================================================
m\n| 1   2     3       4         5           6             7
---+------------------------------------------------------------
1  | 1   3     6      10        15          21            28 ...
2  | 1   7    28      88       245         639          1608 ...
3  | 1  17   144     920      5191       27651        143342 ...
4  | 1  41   730    9362    104989     1111283      11457514 ...
5  | 1  99  3692   94280   2075271    42972329     866126030 ...
6  | 1 239 18666  947760  40792921  1642690309   64270256276 ...
7  | 1 577 94384 9528128 801218515 62618577481 4741764527414 ...
  ...
		

Crossrefs

Formula

T(m,n) = A287151(m,n) - 2*A287151(m-1,n) + A287151(m-2,n) for m > 2.