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.

A250908 Number of (n+1)X(3+1) 0..2 arrays with no 2X2 subblock having its maximum diagonal element less than its minimum antidiagonal element.

This page as a plain text file.
%I A250908 #6 Jul 23 2025 12:50:31
%S A250908 4909,297873,18077319,1096982379,66566704705,4039362762435,
%T A250908 245114118899485,14873861407326111,902566310928490467,
%U A250908 54768961329136851033,3323455667098397402917,201671846608424737679469
%N A250908 Number of (n+1)X(3+1) 0..2 arrays with no 2X2 subblock having its maximum diagonal element less than its minimum antidiagonal element.
%C A250908 Column 3 of A250913
%H A250908 R. H. Hardin, <a href="/A250908/b250908.txt">Table of n, a(n) for n = 1..210</a>
%F A250908 Empirical: a(n) = 74*a(n-1) -825*a(n-2) +1101*a(n-3) -4926*a(n-4) +231*a(n-5) +1684*a(n-6) +736*a(n-7)
%e A250908 Some solutions for n=1
%e A250908 ..2..2..1..2....0..2..2..1....2..1..0..2....0..2..0..0....1..2..1..1
%e A250908 ..1..2..2..2....0..1..2..1....2..0..1..1....1..1..0..1....0..2..1..0
%K A250908 nonn
%O A250908 1,1
%A A250908 _R. H. Hardin_, Nov 28 2014