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 A202931 #7 Jul 22 2025 16:52:50 %S A202931 3,6,6,12,52,12,24,352,352,24,48,2444,8460,2444,48,96,17508,194636, %T A202931 194636,17508,96,192,124340,4439916,14394092,4439916,124340,192,384, %U A202931 872940,100236532,1032147416,1032147416,100236532,872940,384,768,6112832 %N A202931 T(n,k)=Number of nXk 0..2 arrays with adjacent row and column sums unequal. %C A202931 Table starts %C A202931 ....3........6..........12............24.............48.............96 %C A202931 ....6.......52.........352..........2444..........17508.........124340 %C A202931 ...12......352........8460........194636........4439916......100236532 %C A202931 ...24.....2444......194636......14394092.....1032147416....72961197604 %C A202931 ...48....17508.....4439916....1032147416...231197740500.50721408178292 %C A202931 ...96...124340...100236532...72961197604.50721408178292 %C A202931 ..192...872940..2247406834.5108912536716 %C A202931 ..384..6112832.50175952564 %C A202931 ..768.42822036 %C A202931 .1536 %H A202931 R. H. Hardin, <a href="/A202931/b202931.txt">Table of n, a(n) for n = 1..60</a> %e A202931 Some solutions for n=4 k=3 %e A202931 ..0..0..1....0..2..1....0..2..1....0..2..0....0..1..2....1..0..2....0..2..1 %e A202931 ..1..1..1....1..1..2....1..2..2....2..0..1....0..0..0....2..1..1....2..2..1 %e A202931 ..2..0..2....0..2..0....2..1..0....2..2..2....0..1..1....0..2..0....0..1..1 %e A202931 ..1..0..2....2..2..2....0..0..1....0..2..0....2..1..1....0..1..0....0..1..2 %Y A202931 Diagonal is A202649 %K A202931 nonn,tabl %O A202931 1,1 %A A202931 _R. H. Hardin_ Dec 26 2011