editing
approved
editing
approved
R. H. Hardin, <a href="/A282525/b282525.txt">Table of n, a(n) for n = 1..210</a>
allocated for R. H. Hardin
Number of nX5 0..1 arrays with no 1 equal to more than two of its king-move neighbors.
32, 473, 5675, 86258, 1207312, 17100576, 243903065, 3461268322, 49204976763, 699393940820, 9939398057433, 141269301662515, 2007801988480419, 28536092260831837, 405573924391030459, 5764272209120162513
1,1
Column 5 of A282528.
Empirical: a(n) = 14*a(n-1) +11*a(n-2) +11*a(n-3) -2094*a(n-4) +5070*a(n-5) -8140*a(n-6) +28850*a(n-7) -16179*a(n-8) +37380*a(n-9) +24568*a(n-10) -348962*a(n-11) -67455*a(n-12) -1327230*a(n-13) +1682530*a(n-14) +762700*a(n-15) +3424450*a(n-16) +2318786*a(n-17) -2922547*a(n-18) -592553*a(n-19) -10324266*a(n-20) -307185*a(n-21) +3976888*a(n-22) -994291*a(n-23) -618512*a(n-24) +460813*a(n-25) -20410*a(n-26) -21671*a(n-27) +6413*a(n-28) -5444*a(n-29) +1368*a(n-30) -16*a(n-31)
Some solutions for n=4
..0..1..1..0..1. .1..0..0..0..0. .0..1..0..0..1. .0..0..1..1..0
..0..0..1..0..1. .0..0..0..0..1. .0..1..0..0..0. .0..0..1..0..0
..0..0..0..0..0. .0..0..1..0..1. .0..1..0..1..0. .0..0..0..0..1
..1..0..1..0..0. .0..0..0..0..1. .0..0..0..1..1. .1..0..1..0..0
Cf. A282528.
allocated
nonn
R. H. Hardin, Feb 17 2017
approved
editing
allocated for R. H. Hardin
allocated
approved