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.

A281053 Number of nX5 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.

This page as a plain text file.
%I A281053 #4 Jan 13 2017 16:56:39
%S A281053 2,104,618,2452,7803,22106,58005,144283,344972,800225,1812024,4023754,
%T A281053 8791481,18948288,40366695,85135873,177990242,369259703,760850914,
%U A281053 1558181104,3173635543,6432024694,12977428633,26076680087,52202242904
%N A281053 Number of nX5 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.
%C A281053 Column 5 of A281056.
%H A281053 R. H. Hardin, <a href="/A281053/b281053.txt">Table of n, a(n) for n = 1..210</a>
%F A281053 Empirical: a(n) = 5*a(n-1) -6*a(n-2) -4*a(n-3) +5*a(n-4) +9*a(n-5) -12*a(n-7) -3*a(n-8) +3*a(n-9) +6*a(n-10) -a(n-12) -a(n-13) for n>16
%e A281053 Some solutions for n=4
%e A281053 ..0..1..1..0..1. .0..0..1..0..1. .0..0..0..1..0. .0..1..0..1..0
%e A281053 ..1..0..1..0..1. .1..1..1..0..0. .1..1..0..1..1. .0..1..1..0..1
%e A281053 ..1..0..1..0..1. .1..0..1..1..0. .0..1..0..0..0. .1..0..1..0..0
%e A281053 ..0..0..1..0..0. .0..1..0..1..0. .0..1..0..1..0. .1..0..1..1..0
%Y A281053 Cf. A281056.
%K A281053 nonn
%O A281053 1,1
%A A281053 _R. H. Hardin_, Jan 13 2017