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 A206700 #7 Jul 22 2025 19:37:45 %S A206700 3,9,9,26,81,26,75,676,676,75,216,5625,15712,5625,216,622,46656, %T A206700 363465,363465,46656,622,1791,386884,8366690,23335217,8366690,386884, %U A206700 1791,5157,3207681,192513201,1488199144,1488199144,192513201,3207681,5157,14849 %N A206700 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z-2 z-1 z in any row or column. %C A206700 Table starts %C A206700 ....3........9...........26..............75.................216 %C A206700 ....9.......81..........676............5625...............46656 %C A206700 ...26......676........15712..........363465.............8366690 %C A206700 ...75.....5625.......363465........23335217..........1488199144 %C A206700 ..216....46656......8366690......1488199144........262482902920 %C A206700 ..622...386884....192513201.....94853765621......46260684361347 %C A206700 .1791..3207681...4428597297...6043775871265....8149739471342829 %C A206700 .5157.26594649.101873060353.385074186960645.1435662206447144342 %H A206700 R. H. Hardin, <a href="/A206700/b206700.txt">Table of n, a(n) for n = 1..220</a> %e A206700 Some solutions for n=4 k=3 %e A206700 ..2..0..1....2..0..1....0..0..2....2..0..1....2..1..0....2..2..2....2..1..0 %e A206700 ..0..0..2....2..0..2....0..0..2....2..0..2....0..1..1....1..2..1....2..1..2 %e A206700 ..1..1..2....1..0..2....0..0..0....2..0..2....1..0..0....0..2..2....2..1..1 %e A206700 ..0..0..1....1..2..1....1..2..0....2..0..1....1..2..2....0..0..2....0..1..1 %Y A206700 Column 1 is A076264 %K A206700 nonn,tabl %O A206700 1,1 %A A206700 _R. H. Hardin_ Feb 11 2012