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.
%I A252537 #7 Dec 04 2018 14:35:49 %S A252537 546,676,1114,1676,4420,7184,11456,31136,50560,83840,232192,376832, %T A252537 639488,1789952,2904064,4990976,14049280,22790144,39428096,111312896, %U A252537 180551680,313425920,886177792,1437335552,2499411968,7072120832 %N A252537 Number of (5+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7. %H A252537 R. H. Hardin, <a href="/A252537/b252537.txt">Table of n, a(n) for n = 1..210</a> %F A252537 Empirical: a(n) = 12*a(n-3) - 32*a(n-6) for n>8. %F A252537 Empirical g.f.: 2*x*(273 + 338*x + 557*x^2 - 2438*x^3 - 1846*x^4 - 3092*x^5 + 4408*x^6 - 136*x^7) / ((1 - 2*x)*(1 + 2*x + 4*x^2)*(1 - 4*x^3)). - _Colin Barker_, Dec 04 2018 %e A252537 Some solutions for n=4: %e A252537 ..1..2..0..1..1..0....0..2..0..0..2..0....2..3..2..2..3..2....1..3..3..0..0..3 %e A252537 ..0..1..1..0..1..1....1..1..0..1..1..0....3..3..1..3..3..0....2..3..2..2..3..2 %e A252537 ..0..2..0..0..2..0....0..1..1..0..1..1....3..2..2..3..2..2....2..2..3..2..2..3 %e A252537 ..1..1..0..1..1..0....0..2..0..0..2..0....2..3..2..2..3..2....0..3..3..1..3..3 %e A252537 ..0..1..1..0..1..1....1..1..0..1..1..0....3..3..1..3..3..1....2..3..2..2..3..2 %e A252537 ..0..3..0..0..3..0....0..1..1..0..1..1....3..2..2..3..2..2....2..2..3..2..2..3 %e A252537 ..1..1..0..1..1..0....0..2..0..0..2..0....2..3..2..2..3..2....1..3..3..1..3..3 %Y A252537 Row 5 of A252532. %K A252537 nonn %O A252537 1,1 %A A252537 _R. H. Hardin_, Dec 18 2014