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 A209527 #7 Jul 22 2025 21:48:19 %S A209527 1,2,2,5,6,5,15,57,57,15,52,700,2027,700,52,203,10677,107693,107693, %T A209527 10677,203,877,193676,7700397,27323948,7700397,193676,877,4140, %U A209527 4054358,687132348,9700576474,9700576474,687132348,4054358,4140,21146,95534880 %N A209527 T(n,k)=Number of nXk 0..7 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..7 introduced in row major order. %C A209527 Table starts %C A209527 ....1........2.............5.................15.......................52 %C A209527 ....2........6............57................700....................10677 %C A209527 ....5.......57..........2027.............107693..................7700397 %C A209527 ...15......700........107693...........27323948...............9700576474 %C A209527 ...52....10677.......7700397.........9700576474...........16484968944748 %C A209527 ..203...193676.....687132348......4194606038254........31813625228165210 %C A209527 ..877..4054358...71519658191...2002617518101082.....64398780661554524050 %C A209527 .4140.95534880.8190834795146.999998646599976052.132601740316897661044124 %H A209527 R. H. Hardin, <a href="/A209527/b209527.txt">Table of n, a(n) for n = 1..84</a> %e A209527 Some solutions for n=5 k=3 %e A209527 ..0..0..0....0..0..0....0..0..0....0..0..1....0..0..1....0..0..0....0..1..0 %e A209527 ..1..2..1....1..2..1....1..2..1....1..2..0....1..2..2....1..2..3....0..2..0 %e A209527 ..2..0..0....0..0..0....0..0..1....1..0..3....0..0..1....1..0..0....0..1..0 %e A209527 ..0..3..1....1..2..1....1..2..0....0..2..0....1..2..0....0..2..3....0..2..1 %e A209527 ..3..1..0....0..1..0....0..0..1....0..1..0....0..0..1....2..3..0....1..2..0 %Y A209527 Column 1 is A099263 %K A209527 nonn,tabl %O A209527 1,2 %A A209527 _R. H. Hardin_ Mar 10 2012