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 A252577 #6 Jun 02 2025 11:24:12 %S A252577 890,1558,4168,9051,30532,92725,208375,715437,2196824,4932817, %T A252577 17087917,52719076,118137939,412475333,1277261765,2857270465, %U A252577 10039630707,31180060771,69654819267,245981412469,765710684488,1708718651733 %N A252577 Number of (3+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 5 6 or 7. %C A252577 Row 3 of A252574 %H A252577 R. H. Hardin, <a href="/A252577/b252577.txt">Table of n, a(n) for n = 1..210</a> %F A252577 Empirical: a(n) = 46*a(n-3) -572*a(n-6) +1298*a(n-9) -3089*a(n-12) +4222*a(n-15) -3472*a(n-18) +3104*a(n-21) -1536*a(n-24) for n>32 %e A252577 Some solutions for n=4 %e A252577 ..0..0..2..0..0..2....1..3..2..2..3..1....1..0..0..2..0..0....0..2..0..0..2..0 %e A252577 ..3..1..2..3..2..2....0..0..1..0..0..2....2..3..1..2..3..2....0..0..2..0..0..2 %e A252577 ..0..2..0..0..1..0....2..0..0..2..0..0....0..0..2..0..0..1....3..2..2..3..2..1 %e A252577 ..0..0..2..0..0..2....2..3..2..2..3..2....2..0..0..1..0..0....0..1..0..0..2..0 %e A252577 ..3..2..2..3..2..1....0..0..1..0..0..1....2..3..2..2..3..2....1..0..1..0..0..2 %K A252577 nonn %O A252577 1,1 %A A252577 _R. H. Hardin_, Dec 18 2014