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 A209100 #7 Jul 22 2025 21:38:33 %S A209100 1,2,2,5,11,5,14,76,82,14,41,520,1326,612,41,122,3552,20928,23248, %T A209100 4568,122,365,24256,329064,849548,407832,34096,365,1094,165632, %U A209100 5171088,30836932,34538488,7154944,254496,1094,3281,1131008,81254376,1118366188 %N A209100 T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors. %C A209100 Table starts %C A209100 ....1.......2..........5............14...............41.................122 %C A209100 ....2......11.........76...........520.............3552...............24256 %C A209100 ....5......82.......1326.........20928...........329064.............5171088 %C A209100 ...14.....612......23248........849548.........30836932..........1118366188 %C A209100 ...41....4568.....407832......34538488.......2896732704........242632290432 %C A209100 ..122...34096....7154944....1404480904.....272236743760......52675800891748 %C A209100 ..365..254496..125526240...57113932788...25586970618660...11437585318270860 %C A209100 .1094.1899584.2202232576.2322577420320.2404896311723064.2483525516352937680 %H A209100 R. H. Hardin, <a href="/A209100/b209100.txt">Table of n, a(n) for n = 1..254</a> %e A209100 Some solutions for n=4 k=3 %e A209100 ..0..0..0....0..0..0....0..0..1....0..0..0....0..0..1....0..0..1....0..0..0 %e A209100 ..1..1..1....1..1..2....1..2..1....1..1..1....2..0..2....2..0..2....1..1..2 %e A209100 ..2..0..0....2..0..0....1..0..1....2..2..0....0..2..0....1..0..2....2..0..1 %e A209100 ..1..2..2....1..1..1....2..1..2....1..2..1....2..0..2....1..2..1....0..1..0 %Y A209100 Column 1 and row 1 are A007051(n-1) %K A209100 nonn,tabl %O A209100 1,2 %A A209100 _R. H. Hardin_ Mar 05 2012