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 A252530 #8 Dec 04 2018 11:04:10 %S A252530 932,1000,1760,2440,7184,13184,18656,54464,101888,145792,423680, %T A252530 800768,1152512,3341312,6348800,9164800,26537984,50561024,73097216, %U A252530 211533824,403570688,583892992,1689190400,3224895488,4667604992,13501202432 %N A252530 Number of (n+2) X (6+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 A252530 R. H. Hardin, <a href="/A252530/b252530.txt">Table of n, a(n) for n = 1..210</a> %F A252530 Empirical: a(n) = 12*a(n-3) - 32*a(n-6) for n>8. %F A252530 Empirical g.f.: 4*x*(233 + 250*x + 440*x^2 - 2186*x^3 - 1204*x^4 - 1984*x^5 + 4800*x^6 + 64*x^7) / ((1 - 2*x)*(1 + 2*x + 4*x^2)*(1 - 4*x^3)). - _Colin Barker_, Dec 04 2018 %e A252530 Some solutions for n=4: %e A252530 ..0..1..1..0..1..1..0..1....2..2..3..2..2..3..2..2....2..0..0..3..0..0..3..3 %e A252530 ..1..0..1..1..0..1..1..0....3..2..2..3..2..2..3..2....1..0..1..1..0..1..1..0 %e A252530 ..0..0..2..0..0..3..0..0....3..0..3..3..1..3..3..0....1..1..0..1..1..0..1..1 %e A252530 ..0..1..1..0..1..1..0..1....2..2..3..2..2..3..2..2....3..0..0..3..0..0..3..0 %e A252530 ..1..0..1..1..0..1..1..0....3..2..2..3..2..2..3..2....1..0..1..1..0..1..1..0 %e A252530 ..0..0..3..0..0..2..0..0....3..0..3..3..0..3..3..0....1..1..0..1..1..0..1..1 %Y A252530 Column 6 of A252532. %K A252530 nonn %O A252530 1,1 %A A252530 _R. H. Hardin_, Dec 18 2014