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 A206650 #8 Jul 22 2025 19:35:10 %S A206650 1,2,2,4,14,4,11,96,96,11,30,726,1625,726,30,82,5400,30145,30145,5400, %T A206650 82,224,40344,545520,1414023,545520,40344,224,612,301056,9937823, %U A206650 64166392,64166392,9937823,301056,612,1672,2247264,180716227,2937839117 %N A206650 T(n,k)=Number of nXk 0..2 arrays with no occurrence of three equal elements in a row horizontally or vertically, and new values 0..2 introduced in row major order. %C A206650 Table starts %C A206650 ...1.......2..........4............11................30...................82 %C A206650 ...2......14.........96...........726..............5400................40344 %C A206650 ...4......96.......1625.........30145............545520..............9937823 %C A206650 ..11.....726......30145.......1414023..........64166392...........2937839117 %C A206650 ..30....5400.....545520......64166392........7241587334.........826407481102 %C A206650 ..82...40344....9937823....2937839117......826407481102......235596375117548 %C A206650 .224..301056..180716227..134185561617....94026798615720....66923081500826797 %C A206650 .612.2247264.3287842038.6132878568838.10706810410657410.19028556027562892700 %H A206650 R. H. Hardin, <a href="/A206650/b206650.txt">Table of n, a(n) for n = 1..112</a> %e A206650 Some solutions for n=4 k=3 %e A206650 ..0..1..2....0..0..1....0..0..1....0..0..1....0..1..0....0..0..1....0..0..1 %e A206650 ..1..2..1....0..0..1....2..0..2....2..1..2....2..1..2....1..2..1....2..0..0 %e A206650 ..0..2..1....1..2..0....2..1..2....2..2..1....2..2..1....0..2..2....2..1..0 %e A206650 ..1..1..2....1..2..1....0..0..1....0..1..1....0..1..1....0..0..2....0..2..2 %Y A206650 Column 1 is A021006(n-3) %Y A206650 Column 2 is A204699 %K A206650 nonn,tabl %O A206650 1,2 %A A206650 _R. H. Hardin_ Feb 11 2012