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.

A252068 Number of (n+2)X(1+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.

This page as a plain text file.
%I A252068 #6 Jun 02 2025 10:45:19
%S A252068 92,105,183,375,767,1573,3279,6994,15046,32452,70313,153169,334742,
%T A252068 732720,1606016,3524854,7743783,17022376,37434303,82351952,181216059,
%U A252068 398841171,877929646,1932693875,4255002737,9368295558,20627108406
%N A252068 Number of (n+2)X(1+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.
%C A252068 Column 1 of A252075
%H A252068 R. H. Hardin, <a href="/A252068/b252068.txt">Table of n, a(n) for n = 1..210</a>
%F A252068 Empirical: a(n) = 2*a(n-1) +2*a(n-3) +2*a(n-4) -5*a(n-5) -6*a(n-6) -8*a(n-7) -3*a(n-8) +3*a(n-9) +6*a(n-10) +6*a(n-11) +2*a(n-12) for n>14
%e A252068 Some solutions for n=4
%e A252068 ..2..2..1....2..2..2....1..2..2....2..2..2....2..2..2....1..2..2....0..1..1
%e A252068 ..1..2..2....1..2..2....2..2..2....2..1..2....2..2..2....2..2..2....1..0..0
%e A252068 ..2..2..2....2..2..2....2..1..2....2..2..2....2..2..2....2..2..2....0..0..1
%e A252068 ..2..2..2....2..1..2....2..2..2....2..2..2....2..2..1....2..2..2....1..1..0
%e A252068 ..2..2..2....2..2..2....1..2..2....1..2..2....1..2..2....1..2..2....0..0..1
%e A252068 ..2..2..1....2..2..1....2..1..2....2..2..1....2..2..2....2..2..1....1..1..0
%K A252068 nonn
%O A252068 1,1
%A A252068 _R. H. Hardin_, Dec 13 2014