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.

A297296 Number of n X 5 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1s.

This page as a plain text file.
%I A297296 #7 Feb 26 2019 11:50:48
%S A297296 1,4,9,21,49,114,266,620,1446,3372,7864,18340,42772,99752,232640,
%T A297296 542560,1265352,2951040,6882384,16051024,37434032,87303264,203607776,
%U A297296 474851968,1107444896,2582771648,6023513600,14047976768,32762547648,76408478336
%N A297296 Number of n X 5 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1s.
%H A297296 R. H. Hardin, <a href="/A297296/b297296.txt">Table of n, a(n) for n = 1..210</a>
%F A297296 Empirical: a(n) = 2*a(n-1) + 2*a(n-2) - 2*a(n-3) - 2*a(n-4) for n>5.
%F A297296 Empirical g.f.: x*(1 + x)*(1 + x - 2*x^2 - x^3) / (1 - 2*x - 2*x^2 + 2*x^3 + 2*x^4). - _Colin Barker_, Feb 26 2019
%e A297296 Some solutions for n=5:
%e A297296 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..1..1
%e A297296 ..0..0..1..1..0. .0..0..1..1..1. .0..0..0..0..0. .0..0..1..1..0
%e A297296 ..0..1..1..0..0. .0..1..0..1..0. .0..0..0..0..0. .0..0..0..1..1
%e A297296 ..0..0..0..0..0. .1..1..1..0..0. .0..0..0..1..1. .0..0..1..1..0
%e A297296 ..0..0..0..0..0. .0..0..0..0..0. .0..0..1..1..0. .0..0..0..0..0
%Y A297296 Column 5 of A297299.
%K A297296 nonn
%O A297296 1,2
%A A297296 _R. H. Hardin_, Dec 27 2017