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.

A252579 Number of (5+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 A252579 #6 Jun 02 2025 11:24:27
%S A252579 2637,7610,34532,88844,498696,2538669,6590930,37656158,199331443,
%T A252579 514906002,2994563004,16370844276,42106677118,248304737187,
%U A252579 1390789570131,3565907298743,21240150477364,121018033333627,309607017470686
%N A252579 Number of (5+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 A252579 Row 5 of A252574
%H A252579 R. H. Hardin, <a href="/A252579/b252579.txt">Table of n, a(n) for n = 1..210</a>
%F A252579 Empirical: a(n) = 156*a(n-3) -6470*a(n-6) +53472*a(n-9) -284258*a(n-12) +1115672*a(n-15) -1799999*a(n-18) +969878*a(n-21) -48450*a(n-24) for n>32
%e A252579 Some solutions for n=4
%e A252579 ..2..3..2..2..3..1....2..3..2..1..3..2....2..1..3..2..1..3....2..3..1..2..3..2
%e A252579 ..0..0..2..0..0..2....0..0..2..0..0..2....2..0..0..2..0..0....0..0..2..0..0..2
%e A252579 ..2..0..0..2..0..0....2..0..0..2..0..0....0..2..0..0..2..0....2..0..0..2..0..0
%e A252579 ..1..3..2..2..3..2....1..3..2..1..3..2....1..1..3..2..2..3....2..3..1..2..3..1
%e A252579 ..0..0..1..0..0..2....0..0..2..0..0..2....2..0..0..2..0..0....0..0..2..0..0..2
%e A252579 ..2..0..0..1..0..0....2..0..0..2..0..0....0..2..0..0..2..0....2..0..0..2..0..0
%e A252579 ..2..3..2..2..3..2....1..3..1..1..3..1....1..1..3..1..2..3....1..3..2..1..3..1
%K A252579 nonn
%O A252579 1,1
%A A252579 _R. H. Hardin_, Dec 18 2014