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 A204630 #7 Jul 22 2025 18:11:35 %S A204630 12,96,96,768,2049,768,6144,43734,43734,6144,49152,933462,2490558, %T A204630 933462,49152,393216,19923888,141832254,141832254,19923888,393216, %U A204630 3145728,425257068,8077061502,21550390395,8077061502,425257068,3145728,25165824 %N A204630 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having unequal diagonal elements or unequal antidiagonal elements, and new values 0..2 introduced in row major order. %C A204630 Table starts %C A204630 .......12...........96..............768.................6144 %C A204630 .......96.........2049............43734...............933462 %C A204630 ......768........43734..........2490558............141832254 %C A204630 .....6144.......933462........141832254..........21550390395 %C A204630 ....49152.....19923888.......8077061502........3274427479938 %C A204630 ...393216....425257068.....459972403614......497525810748759 %C A204630 ..3145728...9076721064...26194503047262....75595484720747496 %C A204630 .25165824.193734264456.1491724252385406.11486192649538372653 %H A204630 R. H. Hardin, <a href="/A204630/b204630.txt">Table of n, a(n) for n = 1..264</a> %e A204630 Some solutions for n=3 k=3 %e A204630 ..0..0..0..1....0..0..0..0....0..0..0..1....0..0..1..2....0..1..1..0 %e A204630 ..2..0..1..1....0..1..0..2....2..1..0..2....2..1..1..0....1..2..1..2 %e A204630 ..0..0..1..2....2..0..2..2....2..0..0..2....1..1..2..0....0..1..0..1 %e A204630 ..2..0..0..1....0..0..1..0....1..0..1..2....2..1..2..2....2..0..0..1 %K A204630 nonn,tabl %O A204630 1,1 %A A204630 _R. H. Hardin_ Jan 17 2012