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 A252535 #8 Dec 05 2018 03:39:33 %S A252535 460,334,466,626,1120,1760,2404,4304,6832,9416,16864,26912,37264, %T A252535 66752,106816,148256,265600,425600,591424,1059584,1699072,2362496, %U A252535 4232704,6789632,9443584,16919552,27145216,37761536,67655680,108554240,151020544 %N A252535 Number of (3+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 A252535 R. H. Hardin, <a href="/A252535/b252535.txt">Table of n, a(n) for n = 1..210</a> %F A252535 Empirical: a(n) = 6*a(n-3) - 8*a(n-6) for n>8. %F A252535 Empirical g.f.: 2*x*(230 + 167*x + 233*x^2 - 1067*x^3 - 442*x^4 - 518*x^5 + 1164*x^6 + 128*x^7) / ((1 - 2*x^3)*(1 - 4*x^3)). - _Colin Barker_, Dec 04 2018 %e A252535 Some solutions for n=4: %e A252535 ..3..3..1..3..3..1....1..0..1..1..0..1....1..1..0..1..1..0....0..0..2..0..0..2 %e A252535 ..3..2..2..3..2..2....0..0..3..0..0..2....3..0..0..3..0..3....0..1..1..0..1..1 %e A252535 ..2..3..2..2..3..2....0..1..1..0..1..1....1..0..1..1..0..1....1..0..1..1..0..1 %e A252535 ..3..3..1..3..3..1....1..0..1..1..0..1....1..1..0..1..1..0....0..0..2..0..0..3 %e A252535 ..3..2..2..3..2..1....0..3..3..0..0..2....2..0..0..2..0..0....0..1..1..0..1..1 %Y A252535 Row 3 of A252532. %K A252535 nonn %O A252535 1,1 %A A252535 _R. H. Hardin_, Dec 18 2014