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 A222654 #6 Jul 23 2025 02:52:43 %S A222654 1,1,1,2,7,2,11,60,60,11,34,724,1229,724,34,131,7364,61757,61757,7364, %T A222654 131,438,84816,1073368,5024944,1073368,84816,438,2150,927152,58834301, %U A222654 411489189,411489189,58834301,927152,2150,7676,10585088,1009942505 %N A222654 T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order. %C A222654 Table starts %C A222654 .....1.........1...........2............11.............34............131 %C A222654 .....1.........7..........60...........724...........7364..........84816 %C A222654 .....2........60........1229.........61757........1073368.......58834301 %C A222654 ....11.......724.......61757.......5024944......411489189....33625853402 %C A222654 ....34......7364.....1073368.....411489189....46185208463.19094951329287 %C A222654 ...131.....84816....58834301...33625853402.19094951329287 %C A222654 ...438....927152..1009942505.2757290901238 %C A222654 ..2150..10585088.57422493141 %C A222654 ..7676.119198624 %C A222654 .32491 %H A222654 R. H. Hardin, <a href="/A222654/b222654.txt">Table of n, a(n) for n = 1..59</a> %e A222654 Some solutions for n=3 k=4 %e A222654 ..0..0..1..0....0..1..2..3....0..1..0..2....0..1..2..1....0..1..0..0 %e A222654 ..0..2..2..3....2..2..2..0....2..0..0..1....2..3..0..2....2..3..2..3 %e A222654 ..3..2..1..0....0..2..1..2....3..0..2..3....0..3..2..2....0..0..1..1 %K A222654 nonn,tabl %O A222654 1,4 %A A222654 _R. H. Hardin_ Feb 27 2013