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 A209503 #7 Jul 22 2025 21:46:32 %S A209503 1,2,2,5,6,5,15,57,57,15,52,690,1938,690,52,202,9393,78135,78135,9393, %T A209503 202,855,133380,3268686,9502354,3268686,133380,855,3845,1920126, %U A209503 137627625,1165032679,1165032679,137627625,1920126,3845,18002,27760512 %N A209503 T(n,k)=Number of nXk 0..4 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..4 introduced in row major order. %C A209503 Table starts %C A209503 ....1........2............5...............15...................52 %C A209503 ....2........6...........57..............690.................9393 %C A209503 ....5.......57.........1938............78135..............3268686 %C A209503 ...15......690........78135..........9502354...........1165032679 %C A209503 ...52.....9393......3268686.......1165032679.........416022303027 %C A209503 ..202...133380....137627625.....142937856372......148562491090605 %C A209503 ..855..1920126...5801378991...17538444837670....53052739133301878 %C A209503 .3845.27760512.244591579065.2151975129988088.18945498248887912305 %H A209503 R. H. Hardin, <a href="/A209503/b209503.txt">Table of n, a(n) for n = 1..112</a> %e A209503 Some solutions for n=4 k=3 %e A209503 ..0..0..1....0..0..0....0..0..0....0..0..0....0..0..0....0..0..0....0..0..1 %e A209503 ..1..2..0....1..2..1....1..2..1....1..2..1....1..2..3....1..2..1....2..1..2 %e A209503 ..0..2..1....2..0..0....2..3..2....1..3..3....3..1..1....1..3..1....0..1..3 %e A209503 ..0..1..0....1..2..1....3..4..2....2..1..2....2..2..3....0..0..3....4..1..2 %Y A209503 Column 1 is A056272 %K A209503 nonn,tabl %O A209503 1,2 %A A209503 _R. H. Hardin_ Mar 09 2012