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.

A297311 Number of nX5 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.

This page as a plain text file.
%I A297311 #4 Dec 28 2017 07:25:11
%S A297311 12,207,2577,35476,484808,6623719,90535227,1237278512,16909630099,
%T A297311 231098841942,3158359335337,43164380571143,589914903106589,
%U A297311 8062194454707849,110183650123040906,1505847685192695964
%N A297311 Number of nX5 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.
%C A297311 Column 5 of A297314.
%H A297311 R. H. Hardin, <a href="/A297311/b297311.txt">Table of n, a(n) for n = 1..210</a>
%F A297311 Empirical: a(n) = 6*a(n-1) +91*a(n-2) +215*a(n-3) -317*a(n-4) -733*a(n-5) +1104*a(n-6) -40*a(n-7) -1643*a(n-8) +1667*a(n-9) -589*a(n-10) +69*a(n-11) -a(n-12) for n>14
%e A297311 Some solutions for n=5
%e A297311 ..0..0..0..1..1. .0..0..0..1..1. .0..1..0..0..0. .0..1..0..0..0
%e A297311 ..0..1..0..0..0. .1..1..0..1..0. .1..1..0..0..0. .1..0..0..0..0
%e A297311 ..1..1..0..1..1. .0..0..1..0..0. .1..1..0..1..1. .1..1..0..1..0
%e A297311 ..0..1..0..0..0. .0..0..0..0..1. .0..1..1..0..1. .1..0..1..1..0
%e A297311 ..1..1..1..1..1. .0..1..1..1..0. .0..0..0..1..0. .0..0..1..0..0
%Y A297311 Cf. A297314.
%K A297311 nonn
%O A297311 1,1
%A A297311 _R. H. Hardin_, Dec 28 2017