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 #4 Mar 09 2017 18:28:28
%S 0,0,0,0,0,0,0,1,1,0,0,5,20,5,0,0,28,270,270,28,0,0,145,2763,5988,
%T 2763,145,0,0,703,26662,113984,113984,26662,703,0,0,3288,241796,
%U 2032993,4069571,2032993,241796,3288,0,0,14980,2115564,34279720,136572268
%N T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements.
%C Table starts
%C .0.....0........0..........0.............0................0..................0
%C .0.....0........1..........5............28..............145................703
%C .0.....1.......20........270..........2763............26662.............241796
%C .0.....5......270.......5988........113984..........2032993...........34279720
%C .0....28.....2763.....113984.......4069571........136572268.........4331276717
%C .0...145....26662....2032993.....136572268.......8593156813.......510843580504
%C .0...703...241796...34279720....4331276717.....510843580504.....56913176714906
%C .0..3288..2115564..558718061..132684847054...29325852758117...6121670820777639
%C .0.14980.18020972.8877675769.3961612505725.1640229831666201.641300961433598943
%H R. H. Hardin, <a href="/A283522/b283522.txt">Table of n, a(n) for n = 1..180</a>
%F Empirical for column k:
%F k=1: a(n) = a(n-1)
%F k=2: [order 15]
%F k=3: [order 15] for n>19
%F k=4: [order 39] for n>43
%e Some solutions for n=4 k=4
%e ..0..0..0..1. .1..0..0..0. .0..0..0..0. .1..1..0..1. .0..0..1..0
%e ..1..1..1..0. .0..0..1..0. .0..1..1..0. .1..0..0..0. .1..1..0..0
%e ..1..1..0..1. .0..1..1..1. .0..0..1..1. .0..1..1..1. .1..1..0..0
%e ..0..1..0..0. .0..1..1..1. .0..1..1..1. .0..1..1..1. .1..0..1..0
%K nonn,tabl
%O 1,12
%A _R. H. Hardin_, Mar 09 2017