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 A199132 #7 Jul 22 2025 13:11:13 %S A199132 19,210,1038,48320,887966,5926852,358599045,7633754680,56435001338, %T A199132 3718131446504,84113596169937,647071266317908,44371190146396476, %U A199132 1031280656608709860,8107333731404729122,567373010032314560752 %N A199132 Number of nX7 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor. %C A199132 Column 7 of A199133 %H A199132 R. H. Hardin, <a href="/A199132/b199132.txt">Table of n, a(n) for n = 1..22</a> %e A199132 Some solutions for n=5 %e A199132 ..0..1..0..1..2..0..1....0..1..0..2..1..2..1....0..1..0..2..1..0..1 %e A199132 ..1..0..1..2..0..1..0....1..0..2..1..2..1..0....1..0..2..0..2..1..2 %e A199132 ..0..2..0..1..2..0..2....0..2..1..2..1..2..1....0..1..0..2..1..2..1 %e A199132 ..1..0..1..2..0..2..1....1..0..2..0..2..1..2....1..0..2..1..2..1..2 %e A199132 ..2..1..2..1..2..0..2....0..2..0..1..0..2..0....0..2..1..2..0..2..0 %K A199132 nonn %O A199132 1,1 %A A199132 _R. H. Hardin_ Nov 03 2011