login
A391818
Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from upper left corner to lower right corner, and no 1 having more than two 1's adjacent.
14
1, 1, 1, 1, 3, 1, 1, 5, 5, 1, 1, 8, 17, 8, 1, 1, 13, 39, 39, 13, 1, 1, 20, 83, 132, 83, 20, 1, 1, 32, 175, 389, 389, 175, 32, 1, 1, 52, 375, 1095, 1561, 1095, 375, 52, 1, 1, 85, 807, 3107, 5808, 5808, 3107, 807, 85, 1, 1, 138, 1732, 8790, 21608, 27874, 21608, 8790, 1732, 138, 1
OFFSET
1,5
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..435 (first 29 antidiagonals)
FORMULA
T(m,n) = T(n,m).
EXAMPLE
Array begins:
=====================================================
n\k | 1 2 3 4 5 6 7 8 ...
----+------------------------------------------------
1 | 1 1 1 1 1 1 1 1 ...
2 | 1 3 5 8 13 20 32 52 ...
3 | 1 5 17 39 83 175 375 807 ...
4 | 1 8 39 132 389 1095 3107 8790 ...
5 | 1 13 83 389 1561 5808 21608 81280 ...
6 | 1 20 175 1095 5808 27874 132950 650001 ...
7 | 1 32 375 3107 21608 132950 809249 5091285 ...
8 | 1 52 807 8790 81280 650001 5091285 41309900 ...
...
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Andrew Howroyd, Dec 20 2025
STATUS
approved