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.

A282993 Number of nX5 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors.

This page as a plain text file.
%I A282993 #4 Feb 26 2017 06:45:20
%S A282993 24,291,3971,53389,720417,9706901,130854309,1763845523,23775564134,
%T A282993 320481684651,4319920870201,58230152122968,784910642479634,
%U A282993 10580166410594089,142614855902267366,1922370270814992840
%N A282993 Number of nX5 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors.
%C A282993 Column 5 of A282996.
%H A282993 R. H. Hardin, <a href="/A282993/b282993.txt">Table of n, a(n) for n = 1..210</a>
%F A282993 Empirical: a(n) = 5*a(n-1) +82*a(n-2) +424*a(n-3) +433*a(n-4) -3117*a(n-5) -9658*a(n-6) +8224*a(n-7) +43423*a(n-8) -39527*a(n-9) +4996*a(n-10) -8476*a(n-11) -208460*a(n-12) +596155*a(n-13) -915253*a(n-14) +1321254*a(n-15) -1511538*a(n-16) +1194611*a(n-17) -744475*a(n-18) +454071*a(n-19) -175360*a(n-20) +56609*a(n-21) -83755*a(n-22) -6781*a(n-23) +61170*a(n-24) -17072*a(n-25) -8350*a(n-26) -2485*a(n-27) +1059*a(n-28) +2774*a(n-29) -313*a(n-30) -159*a(n-31) -202*a(n-32) +69*a(n-33) +7*a(n-34) +a(n-35) -a(n-36)
%e A282993 Some solutions for n=5
%e A282993 ..0..1..0..0..0. .1..0..0..0..1. .1..0..0..1..0. .1..0..0..0..0
%e A282993 ..0..0..0..0..1. .0..0..1..0..0. .0..0..1..0..1. .0..0..0..0..1
%e A282993 ..0..0..1..0..0. .0..0..0..0..0. .0..1..0..0..0. .0..0..0..0..1
%e A282993 ..0..1..0..0..1. .1..0..0..0..1. .0..1..0..0..1. .1..0..1..1..0
%e A282993 ..1..0..1..0..1. .0..1..0..0..0. .0..0..0..0..0. .0..0..0..0..1
%Y A282993 Cf. A282996.
%K A282993 nonn
%O A282993 1,1
%A A282993 _R. H. Hardin_, Feb 26 2017