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 A230065 #6 Jun 02 2025 08:40:51 %S A230065 0,225,3645,281961,14082255,793041921,43142680647,2369158188849, %T A230065 129763431348327,7112485499815809,389766441753947727, %U A230065 21360486977871231969,1170607520117723187375,64152453401987618058561 %N A230065 Number of nX5 0..2 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value 2-x(i,j). %C A230065 Column 5 of A230068 %H A230065 R. H. Hardin, <a href="/A230065/b230065.txt">Table of n, a(n) for n = 1..210</a> %F A230065 Empirical: a(n) = 59*a(n-1) -13572*a(n-3) +53018*a(n-4) -4614*a(n-5) -84248*a(n-6) +5703584*a(n-7) -22239144*a(n-8) -30968*a(n-9) +2695936*a(n-10) -13901184*a(n-11) +54290432*a(n-12) -1462272*a(n-13) +65536*a(n-15) -1048576*a(n-16) for n>19 %e A230065 Some solutions for n=3 %e A230065 ..0..1..0..2..0....2..0..2..1..1....1..1..1..2..0....0..1..0..1..1 %e A230065 ..0..2..1..2..0....2..0..1..1..1....1..1..0..2..1....1..2..0..1..1 %e A230065 ..0..2..0..1..0....2..0..2..1..1....1..1..1..1..0....0..2..0..1..1 %K A230065 nonn %O A230065 1,2 %A A230065 _R. H. Hardin_, Oct 08 2013