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.

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

This page as a plain text file.
%I A297297 #4 Dec 27 2017 21:12:01
%S A297297 1,6,17,50,157,495,1574,5031,16123,51749,166241,534301,1717724,
%T A297297 5523165,17760715,57115518,183679098,590706934,1899713778,6109510235,
%U A297297 19648337645,63189642502,203219959503,653562362810,2101879559822,6759719676624
%N A297297 Number of nX6 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1s.
%C A297297 Column 6 of A297299.
%H A297297 R. H. Hardin, <a href="/A297297/b297297.txt">Table of n, a(n) for n = 1..210</a>
%F A297297 Empirical: a(n) = 4*a(n-1) -8*a(n-3) -2*a(n-4) +4*a(n-5) +4*a(n-6) +a(n-7) -a(n-8)
%e A297297 Some solutions for n=5
%e A297297 ..0..0..1..1..1..1. .0..1..1..0..0..0. .0..1..1..0..0..0. .0..0..0..0..0..0
%e A297297 ..0..1..0..0..1..1. .1..1..0..0..0..0. .1..1..0..1..1..1. .0..0..1..1..1..1
%e A297297 ..1..1..1..0..1..1. .0..0..0..1..1..1. .0..0..1..0..1..1. .0..1..0..0..1..1
%e A297297 ..0..1..0..0..1..0. .0..0..1..0..1..0. .0..1..0..0..1..0. .1..1..1..0..1..0
%e A297297 ..1..1..1..1..0..0. .0..1..1..1..0..0. .1..1..1..1..0..0. .0..1..1..1..0..0
%Y A297297 Cf. A297299.
%K A297297 nonn
%O A297297 1,2
%A A297297 _R. H. Hardin_, Dec 27 2017