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 A202636 #7 Jul 22 2025 16:44:22 %S A202636 4,12,12,36,184,36,108,2428,2428,108,324,32676,143028,32676,324,972, %T A202636 443100,8196796,8196796,443100,972,2916,5967248,464590190,1960824272, %U A202636 464590190,5967248,2916,8748,80018540,26143599304,459796683544 %N A202636 T(n,k)=Number of nXk 0..3 arrays with adjacent row and column sums unequal. %C A202636 Table starts %C A202636 .....4.........12............36.............108.............324.............972 %C A202636 ....12........184..........2428...........32676..........443100.........5967248 %C A202636 ....36.......2428........143028.........8196796.......464590190.....26143599304 %C A202636 ...108......32676.......8196796......1960824272....459796683544.106682611433736 %C A202636 ...324.....443100.....464590190....459796683544.443471777729100 %C A202636 ...972....5967248...26143599304.106682611433736 %C A202636 ..2916...80018540.1464347535012 %C A202636 ..8748.1071819720 %C A202636 .26244 %H A202636 R. H. Hardin, <a href="/A202636/b202636.txt">Table of n, a(n) for n = 1..49</a> %e A202636 Some solutions for n=3 k=3 %e A202636 ..2..3..0....0..2..2....0..1..1....3..2..2....2..2..0....3..2..1....2..3..2 %e A202636 ..3..3..1....0..1..1....0..0..1....1..2..3....2..3..3....2..0..1....3..1..2 %e A202636 ..0..1..0....3..1..2....2..2..0....0..1..2....1..3..2....2..3..1....0..0..2 %K A202636 nonn,tabl %O A202636 1,1 %A A202636 _R. H. Hardin_ Dec 21 2011