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.

A297397 Number of 4 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1.

This page as a plain text file.
%I A297397 #7 Feb 28 2019 06:22:30
%S A297397 1,20,57,126,700,2569,7779,31081,117084,400727,1478944,5485580,
%T A297397 19599269,71231855,261062287,945122754,3430304343,12504256178,
%U A297397 45424857782,164983194009,600231458537,2182009835511,7929300624520,28830589829675
%N A297397 Number of 4 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1.
%H A297397 R. H. Hardin, <a href="/A297397/b297397.txt">Table of n, a(n) for n = 1..210</a>
%F A297397 Empirical: a(n) = a(n-1) + 3*a(n-2) + 24*a(n-3) + 11*a(n-4) - 21*a(n-5) - 67*a(n-6) - 9*a(n-7) - 45*a(n-8).
%F A297397 Empirical g.f.: x*(1 + 19*x + 34*x^2 - 15*x^3 - 88*x^4 - 76*x^5 - 54*x^6 - 45*x^7) / (1 - x - 3*x^2 - 24*x^3 - 11*x^4 + 21*x^5 + 67*x^6 + 9*x^7 + 45*x^8). - _Colin Barker_, Feb 28 2019
%e A297397 Some solutions for n=5:
%e A297397 ..0..0..0..0..1. .1..1..0..0..0. .0..0..1..1..0. .1..0..0..0..0
%e A297397 ..0..1..0..1..0. .0..0..0..0..0. .0..0..0..0..0. .0..1..0..0..0
%e A297397 ..1..0..0..1..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..1
%e A297397 ..0..0..1..0..0. .1..1..0..1..1. .0..0..0..1..1. .1..1..0..1..0
%Y A297397 Row 4 of A297395.
%K A297397 nonn
%O A297397 1,2
%A A297397 _R. H. Hardin_, Dec 29 2017