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.

A297597 Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.

This page as a plain text file.
%I A297597 #4 Jan 01 2018 12:10:04
%S A297597 1,20,69,154,752,3145,10131,37929,150388,546267,2000770,7586016,
%T A297597 28281649,104554687,390572927,1458526512,5423019339,20199712660,
%U A297597 75329388620,280578366045,1045017557629,3894288535989,14509490578040,54051253212923
%N A297597 Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.
%C A297597 Row 4 of A297595.
%H A297597 R. H. Hardin, <a href="/A297597/b297597.txt">Table of n, a(n) for n = 1..210</a>
%F A297597 Empirical: a(n) = a(n-1) +3*a(n-2) +24*a(n-3) +23*a(n-4) -17*a(n-5) -95*a(n-6) -73*a(n-7) -45*a(n-8) -36*a(n-9) +4*a(n-10) -4*a(n-11) +2*a(n-12)
%e A297597 Some solutions for n=7
%e A297597 ..0..0..0..1..0..0..0. .0..0..0..0..1..1..0. .1..0..0..0..1..0..1
%e A297597 ..0..0..0..0..1..0..0. .0..0..0..0..0..0..0. .0..1..0..0..1..1..1
%e A297597 ..0..0..0..0..0..0..1. .0..1..0..0..1..1..0. .0..0..0..0..0..0..1
%e A297597 ..0..1..1..0..0..1..0. .1..0..0..0..0..0..0. .0..1..1..0..0..0..0
%Y A297597 Cf. A297595.
%K A297597 nonn
%O A297597 1,2
%A A297597 _R. H. Hardin_, Jan 01 2018