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 A230678 #7 Jun 02 2025 08:45:32 %S A230678 0,423,17271,730503,37034355,1844154933,91258562955,4522036938501, %T A230678 224105728666527,11105653159056021,550345235166102387, %U A230678 27272655718068842535,1351510936295338591335,66974836192708860686913 %N A230678 Number of 4Xn 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value 2-x(i,j). %C A230678 Row 4 of A230675 %H A230678 R. H. Hardin, <a href="/A230678/b230678.txt">Table of n, a(n) for n = 1..210</a> %H A230678 R. H. Hardin, <a href="/A230678/a230678.txt">Empirical recurrence of order 64</a> %F A230678 Empirical recurrence of order 64 (see link above) %e A230678 Some solutions for n=3 %e A230678 ..1..1..0....0..1..0....1..1..1....1..1..2....1..1..1....1..0..2....2..0..1 %e A230678 ..1..2..0....0..2..1....2..0..1....1..0..2....0..2..0....1..1..2....1..1..2 %e A230678 ..2..2..0....0..1..0....2..2..0....1..1..1....2..2..2....0..1..1....1..1..1 %e A230678 ..0..0..2....1..0..2....0..2..0....0..2..1....2..0..0....1..2..1....0..2..1 %K A230678 nonn %O A230678 1,2 %A A230678 _R. H. Hardin_, Oct 27 2013