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 A206621 #7 Jul 22 2025 19:33:55 %S A206621 14,86,86,580,1155,580,4035,17708,17708,4035,27895,270869,623933, %T A206621 270869,27895,192358,4099700,21744156,21744156,4099700,192358,1327931, %U A206621 62250328,752689692,1719525751,752689692,62250328,1327931,9168477,945314307 %N A206621 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order. %C A206621 Table starts %C A206621 ......14..........86............580..............4035.................27895 %C A206621 ......86........1155..........17708............270869...............4099700 %C A206621 .....580.......17708.........623933..........21744156.............752689692 %C A206621 ....4035......270869.......21744156........1719525751..........135010973857 %C A206621 ...27895.....4099700......752689692......135010973857........24021101375251 %C A206621 ..192358....62250328....26135187233....10633148505553......4289914143971114 %C A206621 .1327931...945314307...907138039901...837071761231340....765786718381692875 %C A206621 .9168477.14350695690.31481198946322.65890955765683798.136684817422844172008 %H A206621 R. H. Hardin, <a href="/A206621/b206621.txt">Table of n, a(n) for n = 1..84</a> %e A206621 Some solutions for n=4 k=3 %e A206621 ..0..0..1..0....0..1..2..1....0..0..0..0....0..0..0..0....0..1..1..2 %e A206621 ..0..2..0..1....1..0..1..2....1..2..1..2....1..2..1..2....1..2..2..0 %e A206621 ..2..0..0..1....0..1..1..2....1..0..2..0....1..0..0..0....0..1..0..2 %e A206621 ..2..0..1..2....0..2..0..1....1..2..1..1....1..2..1..2....2..1..2..0 %e A206621 ..1..2..0..2....1..2..1..2....1..0..1..2....2..1..0..2....2..0..2..0 %K A206621 nonn,tabl %O A206621 1,1 %A A206621 _R. H. Hardin_ Feb 10 2012