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 A207398 #9 Jul 22 2025 20:22:24 %S A207398 2,16,102,729,4212,26896,154580,970225,5697150,36000000,216023850, %T A207398 1377968641,8411571224,54080432704,334469528520,2163643890489, %U A207398 13517662791690,87865126849600,553380551724110,3610810383420361 %N A207398 Number of n X n 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically. %C A207398 Diagonal of A207403 %H A207398 R. H. Hardin, <a href="/A207398/b207398.txt">Table of n, a(n) for n = 1..27</a> %e A207398 Some solutions for n=4 %e A207398 ..0..0..0..0....1..0..0..0....1..1..0..1....1..0..0..0....1..0..1..0 %e A207398 ..1..0..1..0....0..1..0..0....1..1..0..1....0..1..0..0....1..1..0..0 %e A207398 ..0..0..0..0....0..1..0..0....1..1..0..1....1..0..0..0....1..1..1..0 %e A207398 ..0..0..0..0....0..1..0..0....1..1..0..1....1..1..0..0....1..1..1..0 %K A207398 nonn %O A207398 1,1 %A A207398 _R. H. Hardin_ Feb 17 2012