Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Jun 29 2018 08:35:25
%S 8,89,1033,11929,137845,1592731,18403423,212644499,2457026181,
%T 28390000737,328035635669,3790326714043,43795780208895,
%U 506043544208099,5847140236199813,67561476345437377,780647102957445445
%N Number of n X 4 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or left-upward diagonal neighbors.
%C Column 4 of A208269.
%H R. H. Hardin, <a href="/A208265/b208265.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 10*a(n-1) + 20*a(n-2) - 21*a(n-3) - 30*a(n-4) + 8*a(n-5).
%F Empirical g.f.: x*(8 + 9*x - 17*x^2 - 13*x^3 + 4*x^4) / (1 - 10*x - 20*x^2 + 21*x^3 + 30*x^4 - 8*x^5). - _Colin Barker_, Jun 29 2018
%e Some solutions for n=4:
%e ..0..1..1..1....0..0..0..1....0..1..0..1....0..0..0..1....0..0..1..0
%e ..1..1..0..0....0..1..1..0....1..1..0..1....1..0..1..0....0..1..1..0
%e ..0..0..1..1....1..1..0..1....0..1..1..0....1..1..1..1....1..1..0..0
%e ..1..1..0..0....0..0..1..0....0..0..1..1....1..0..1..0....1..0..0..1
%Y Cf. A208269.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 24 2012