login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of 9 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{9,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.
2

%I #5 Feb 09 2019 20:53:43

%S 1,28,406,4631,38304,249814,1357051,6362806,26400811,98755951,

%T 337852708,1069253171,3159851197,8786784471,23140533785,58032604728,

%U 139238130793,320911139366,712976624945,1531659348507,3190199728577,6457722870812,12731177730290,24491108899982

%N Number of 9 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{9,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.

%H Alois P. Heinz, <a href="/A323973/b323973.txt">Table of n, a(n) for n = 0..10000</a>

%Y Row (or column) 9 of array in A323846.

%K nonn,easy

%O 0,2

%A _Alois P. Heinz_, Feb 09 2019