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 A208392 #7 Jul 22 2025 21:19:25 %S A208392 1,2,2,5,14,5,14,117,122,14,41,1017,3042,1094,41,122,8838,76806,79092, %T A208392 9842,122,365,76806,1937736,5800644,2056392,88574,365,1094,667476, %U A208392 48890520,424785708,438083928,53466192,797162,1094,3281,5800644 %N A208392 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 two of its immediate leftward or upward or right-upward antidiagonal neighbors. %C A208392 Table starts %C A208392 ....1.......2...........5..............14.................41 %C A208392 ....2......14.........117............1017...............8838 %C A208392 ....5.....122........3042...........76806............1937736 %C A208392 ...14....1094.......79092.........5800644..........424785708 %C A208392 ...41....9842.....2056392.......438083928........93120350760 %C A208392 ..122...88574....53466192.....33085555344.....20413586117376 %C A208392 ..365..797162..1390120992...2498731184736...4475009970818208 %C A208392 .1094.7174454.36143145792.188712490047552.980999326809336384 %H A208392 R. H. Hardin, <a href="/A208392/b208392.txt">Table of n, a(n) for n = 1..301</a> %e A208392 Some solutions for n=4 k=3 %e A208392 ..0..0..1....0..0..0....0..0..0....0..0..0....0..0..0....0..0..1....0..0..1 %e A208392 ..2..0..2....0..1..2....1..1..1....0..1..2....1..2..1....2..0..2....2..0..2 %e A208392 ..1..0..2....0..0..0....1..0..0....2..0..0....0..2..2....2..2..0....0..2..2 %e A208392 ..1..2..1....1..2..0....1..2..2....1..0..1....0..0..2....0..2..1....2..0..2 %Y A208392 Column 1 is A007051(n-1) %Y A208392 Column 2 is A199560(n-1) %Y A208392 Row 1 is A007051(n-1) %K A208392 nonn,tabl %O A208392 1,2 %A A208392 _R. H. Hardin_ Feb 25 2012