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.

A283038 Number of nX4 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element.

This page as a plain text file.
%I A283038 #4 Feb 27 2017 08:56:36
%S A283038 2,68,818,9152,94368,931844,8912378,83420984,767704036,6973000128,
%T A283038 62669779812,558371394860,4938938283902,43417600038648,
%U A283038 379661067157816,3304658457345168,28648616561102224,247474652799713212
%N A283038 Number of nX4 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element.
%C A283038 Column 4 of A283042.
%H A283038 R. H. Hardin, <a href="/A283038/b283038.txt">Table of n, a(n) for n = 1..210</a>
%F A283038 Empirical: a(n) = 8*a(n-1) +38*a(n-2) -98*a(n-3) -1221*a(n-4) -3374*a(n-5) -1845*a(n-6) +8406*a(n-7) +14610*a(n-8) -5894*a(n-9) -20336*a(n-10) +9134*a(n-11) +9660*a(n-12) -7192*a(n-13) +3651*a(n-14) -16004*a(n-15) +9859*a(n-16) +3230*a(n-17) -14482*a(n-18) +15860*a(n-19) -16472*a(n-20) +13768*a(n-21) -9574*a(n-22) +4838*a(n-23) -2040*a(n-24) +772*a(n-25) -272*a(n-26) +84*a(n-27) -16*a(n-28) +4*a(n-29) -a(n-30)
%e A283038 Some solutions for n=4
%e A283038 ..1..0..1..0. .0..0..1..1. .0..0..1..1. .1..0..1..0. .1..1..0..1
%e A283038 ..1..1..0..0. .1..0..1..0. .0..1..0..0. .1..1..0..0. .0..1..0..0
%e A283038 ..0..0..1..0. .0..0..0..1. .1..1..0..1. .0..0..1..0. .0..0..0..1
%e A283038 ..1..1..0..1. .0..0..1..0. .0..1..0..1. .0..1..0..1. .0..0..0..0
%Y A283038 Cf. A283042.
%K A283038 nonn
%O A283038 1,1
%A A283038 _R. H. Hardin_, Feb 27 2017