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 A209744 #7 Jul 22 2025 21:57:01 %S A209744 1,2,2,5,6,5,15,57,57,15,52,700,2025,700,52,203,10594,103373,103373, %T A209744 10594,203,876,183240,6262064,20611956,6262064,183240,876,4111, %U A209744 3412100,404495219,4474325828,4474325828,404495219,3412100,4111,20648,65953664 %N A209744 T(n,k)=Number of nXk 0..5 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order. %C A209744 Table starts %C A209744 ....1........2.............5................15.....................52 %C A209744 ....2........6............57...............700..................10594 %C A209744 ....5.......57..........2025............103373................6262064 %C A209744 ...15......700........103373..........20611956.............4474325828 %C A209744 ...52....10594.......6262064........4474325828..........3309942226828 %C A209744 ..203...183240.....404495219......991613495404.......2462887498725440 %C A209744 ..876..3412100...26715084257...220845828478730....1834383283218723590 %C A209744 .4111.65953664.1777603386801.49242046909442868.1366486932112899379170 %H A209744 R. H. Hardin, <a href="/A209744/b209744.txt">Table of n, a(n) for n = 1..112</a> %e A209744 Some solutions for n=5 k=3 %e A209744 ..0..0..0....0..0..0....0..0..0....0..0..0....0..0..0....0..0..0....0..0..1 %e A209744 ..1..2..1....1..2..1....1..2..1....1..2..1....1..2..1....1..2..1....1..2..0 %e A209744 ..0..1..0....3..3..1....2..3..1....0..0..1....0..0..0....2..0..0....0..0..1 %e A209744 ..1..2..0....0..1..2....1..2..3....2..1..2....1..3..4....0..3..4....1..2..0 %e A209744 ..3..1..0....0..3..1....0..0..0....1..0..0....1..5..3....0..5..4....1..0..3 %Y A209744 Column 1 is A056273 %K A209744 nonn,tabl %O A209744 1,2 %A A209744 _R. H. Hardin_ Mar 12 2012