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 A205415 #7 Jul 22 2025 18:51:11 %S A205415 468,3868,3868,33322,44596,33322,236576,549414,549414,236576,1820215, %T A205415 5686031,10331386,5686031,1820215,14452683,64878898,151598017, %U A205415 151598017,64878898,14452683,109757792,768581101,2553087985,2839359056,2553087985 %N A205415 T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly two ways, and new values 0..2 introduced in row major order. %C A205415 Table starts %C A205415 .......468........3868..........33322.........236576........1820215 %C A205415 ......3868.......44596.........549414........5686031.......64878898 %C A205415 .....33322......549414.......10331386......151598017.....2553087985 %C A205415 ....236576.....5686031......151598017.....2839359056....67792717447 %C A205415 ...1820215....64878898.....2553087985....67792717447..2520131261396 %C A205415 ..14452683...768581101....45661264026..1715387177450.98445276297551 %C A205415 .109757792..8606465750...735422130329.36803297869771 %C A205415 .844627201.98080551694.12286397087182 %H A205415 R. H. Hardin, <a href="/A205415/b205415.txt">Table of n, a(n) for n = 1..60</a> %e A205415 Some solutions for n=3 k=3 %e A205415 ..0..0..0..1..2....0..0..0..1..0....0..1..1..0..1....0..1..0..2..1 %e A205415 ..2..0..0..1..2....0..0..2..1..0....1..1..1..1..1....2..2..2..2..2 %e A205415 ..1..0..1..1..1....2..0..2..1..0....2..2..1..0..0....0..0..0..2..2 %e A205415 ..0..0..0..0..0....1..0..2..2..2....0..0..0..0..0....2..0..2..2..1 %e A205415 ..2..0..1..1..0....1..0..2..1..0....1..1..1..0..1....1..0..2..2..2 %K A205415 nonn,tabl %O A205415 1,1 %A A205415 _R. H. Hardin_ Jan 26 2012