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.

A252566 Number of (n+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.

This page as a plain text file.
%I A252566 #7 Jun 02 2025 11:22:56
%S A252566 702,868,4168,25882,498696,11285381,155864925,12185963853,
%T A252566 945844092853,24332552409889,8322243636131517,2215111350571613524,
%U A252566 98531704627753178786,155638652503561131141300
%N A252566 Number of (n+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 A252566 Diagonal of A252574
%H A252566 R. H. Hardin, <a href="/A252566/b252566.txt">Table of n, a(n) for n = 1..15</a>
%e A252566 Some solutions for n=4
%e A252566 ..0..0..2..0..0..1....0..0..2..0..0..2....2..1..3..1..1..3....1..0..0..2..0..0
%e A252566 ..2..0..0..2..0..0....3..1..2..3..2..2....2..0..0..2..0..0....0..1..0..0..2..0
%e A252566 ..2..3..2..2..3..2....0..2..0..0..2..0....0..2..0..0..2..0....2..2..3..1..2..3
%e A252566 ..0..0..2..0..0..1....0..0..2..0..0..1....2..2..3..2..2..3....2..0..0..2..0..0
%e A252566 ..1..0..0..2..0..0....3..1..1..3..2..2....1..0..0..1..0..0....0..2..0..0..2..0
%e A252566 ..2..3..2..2..3..2....0..2..0..0..2..0....0..1..0..0..1..0....1..2..3..2..1..3
%K A252566 nonn
%O A252566 1,1
%A A252566 _R. H. Hardin_, Dec 18 2014