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 A209465 #9 Jul 22 2025 21:44:40 %S A209465 1,2,2,5,6,5,15,57,57,15,52,700,2027,700,52,203,10676,107472,107472, %T A209465 10676,203,877,192994,7487423,26142922,7487423,192994,877,4139, %U A209465 3966581,613535578,8012278798,8012278798,613535578,3966581,4139,21110,89157292 %N A209465 T(n,k)=Number of nXk 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order. %C A209465 Table starts %C A209465 ....1........2.............5.................15......................52 %C A209465 ....2........6............57................700...................10676 %C A209465 ....5.......57..........2027.............107472.................7487423 %C A209465 ...15......700........107472...........26142922..............8012278798 %C A209465 ...52....10676.......7487423.........8012278798...........9920302864598 %C A209465 ..203...192994.....613535578......2694404849980.......12804264249973850 %C A209465 ..877..3966581...54657856108....937020001725427....16716447554895729642 %C A209465 .4139.89157292.5063931781244.329698685591776814.21891626720034635715808 %H A209465 R. H. Hardin, <a href="/A209465/b209465.txt">Table of n, a(n) for n = 1..84</a> %e A209465 Some.solutions.for.n=4.k=3 %e A209465 ..0..0..1....0..0..1....0..0..0....0..0..1....0..0..0....0..0..0....0..0..0 %e A209465 ..1..2..0....1..2..1....1..2..1....1..2..0....1..2..1....1..2..1....1..2..3 %e A209465 ..0..0..1....0..0..1....0..2..3....2..0..1....0..1..3....3..1..0....0..0..0 %e A209465 ..1..2..0....3..4..1....2..1..1....1..0..2....0..4..4....0..1..2....4..2..4 %Y A209465 Column 1 is A099262 %K A209465 nonn,tabl %O A209465 1,2 %A A209465 _R. H. Hardin_ Mar 09 2012