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 A284771 #6 Apr 05 2020 20:17:38 %S A284771 0,0,0,1,4,1,2,14,14,2,6,52,119,52,6,12,206,720,720,206,12,28,772, %T A284771 5637,10120,5637,772,28,56,2896,38792,145822,145822,38792,2896,56,119, %U A284771 10996,298003,2134812,4219759,2134812,298003,10996,119,236,41862,2180148 %N A284771 T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1. %C A284771 Table starts %C A284771 ..0.....0.......1.........2............6.............12...............28 %C A284771 ..0.....4......14........52..........206............772.............2896 %C A284771 ..1....14.....119.......720.........5637..........38792...........298003 %C A284771 ..2....52.....720.....10120.......145822........2134812.........31677488 %C A284771 ..6...206....5637....145822......4219759......121021322.......3595841703 %C A284771 .12...772...38792...2134812....121021322.....7032604532.....415218866820 %C A284771 .28..2896..298003..31677488...3595841703...415218866820...48994677634459 %C A284771 .56.10996.2180148.474539092.107047691558.24791001439744.5840008221148574 %H A284771 R. H. Hardin, <a href="/A284771/b284771.txt">Table of n, a(n) for n = 1..143</a> %e A284771 Some solutions for n=4, k=4 %e A284771 ..0..0..1..0. .1..1..1..0. .0..0..1..1. .0..1..0..0. .0..0..0..1 %e A284771 ..0..1..1..0. .1..0..0..0. .0..0..0..1. .0..1..1..0. .1..1..0..1 %e A284771 ..0..1..0..1. .0..0..1..1. .0..1..1..0. .0..1..0..0. .0..0..0..0 %e A284771 ..0..1..1..0. .0..1..1..1. .0..1..1..0. .1..0..1..1. .1..1..0..1 %Y A284771 Column 1 is A284449. %K A284771 nonn,tabl %O A284771 1,5 %A A284771 _R. H. Hardin_, Apr 02 2017