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.

A252573 Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 1 2 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 1 2 5 6 or 7.

This page as a plain text file.
%I A252573 #8 Jun 26 2025 11:26:54
%S A252573 9936,47737,208375,959944,6590930,31059674,155864925,994640586,
%T A252573 4728064653,24277561799,152128655769,724041200896,3737920882959,
%U A252573 23334351446462,111056940261198,574039942229995,3581491498190689
%N A252573 Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 1 2 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 1 2 5 6 or 7.
%C A252573 Column 7 of A252574.
%H A252573 R. H. Hardin, <a href="/A252573/b252573.txt">Table of n, a(n) for n = 1..210</a>
%e A252573 Some solutions for n=2
%e A252573 ..2..3..2..2..3..1..2..3..1....2..3..2..2..3..2..2..3..2
%e A252573 ..0..0..1..0..0..2..0..0..2....0..0..2..0..0..1..0..0..2
%e A252573 ..2..0..0..2..0..0..2..0..0....2..0..0..2..0..0..2..0..0
%e A252573 ..2..3..2..2..3..1..2..3..2....2..3..2..2..3..2..2..3..1
%Y A252573 Cf. A252574.
%K A252573 nonn
%O A252573 1,1
%A A252573 _R. H. Hardin_, Dec 18 2014