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.

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

This page as a plain text file.
%I A297222 #4 Dec 27 2017 15:36:34
%S A297222 9,69,535,4210,33158,261939,2063378,16277793,128351805,1012130530,
%T A297222 7981569963,62939687472,496326792470,3913894569563,30863877179841,
%U A297222 243384068190066,1919259204181410,15134747411461711,119348431276698530
%N A297222 Number of nX6 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 neighboring 1s.
%C A297222 Column 6 of A297224.
%H A297222 R. H. Hardin, <a href="/A297222/b297222.txt">Table of n, a(n) for n = 1..210</a>
%F A297222 Empirical: a(n) = a(n-1) +34*a(n-2) +146*a(n-3) +141*a(n-4) -184*a(n-5) -461*a(n-6) +413*a(n-7) -498*a(n-8) -119*a(n-9) +408*a(n-10) +144*a(n-11) for n>13
%e A297222 Some solutions for n=5
%e A297222 ..0..1..1..0..0..1. .0..0..0..0..0..0. .1..1..0..0..1..1. .0..1..0..0..0..0
%e A297222 ..0..0..0..0..1..0. .1..1..0..0..0..0. .0..0..0..0..0..0. .1..0..1..1..0..0
%e A297222 ..1..1..0..0..1..0. .0..1..1..0..0..0. .0..0..0..0..0..0. .0..0..0..0..1..1
%e A297222 ..0..0..0..1..0..0. .0..0..0..0..0..1. .0..0..0..0..0..1. .0..1..1..0..0..0
%e A297222 ..1..1..0..0..0..0. .0..1..1..0..1..0. .0..1..1..0..1..0. .0..0..1..1..0..0
%Y A297222 Cf. A297224.
%K A297222 nonn
%O A297222 1,1
%A A297222 _R. H. Hardin_, Dec 27 2017