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.
%I A282643 #6 Mar 02 2017 12:36:01 %S A282643 13,76,413,2638,15460,92817,557439,3332685,19979228,119669673, %T A282643 716821452,4294298464,25723862625,154096718455,923100717695, %U A282643 5529722705330,33125219903271,198432924637760,1188690440868116,7120718914489889 %N A282643 Number of nX4 0..1 arrays with no 1 equal to more than one of its king-move neighbors. %C A282643 Column 4 of A282647. %H A282643 R. H. Hardin, <a href="/A282643/b282643.txt">Table of n, a(n) for n = 1..210</a> %F A282643 Empirical: a(n) = 2*a(n-1) +16*a(n-2) +45*a(n-3) +16*a(n-4) -2*a(n-5) -51*a(n-6) -35*a(n-7) -23*a(n-8) +7*a(n-9). %F A282643 Empirical: G.f.: -x*(13+50*x+53*x^2+11*x^3-52*x^4-86*x^5-58*x^6-16*x^7+7*x^8) /(-1+2*x+16*x^2+45*x^3+16*x^4-2*x^5-51*x^6-35*x^7-23*x^8+7*x^9) . - _R. J. Mathar_, Mar 02 2017 %e A282643 Some solutions for n=4 %e A282643 ..0..0..0..0. .0..0..1..0. .0..0..1..0. .1..0..1..1. .0..1..0..1 %e A282643 ..0..0..0..1. .0..1..0..0. .0..0..0..1. .0..0..0..0. .1..0..0..1 %e A282643 ..1..0..0..0. .0..0..0..0. .1..0..0..0. .0..0..0..0. .0..0..0..0 %e A282643 ..1..0..1..1. .1..0..1..0. .0..1..0..0. .0..1..0..0. .0..1..1..0 %Y A282643 Cf. A282647. %K A282643 nonn %O A282643 1,1 %A A282643 _R. H. Hardin_, Feb 20 2017