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 A217965 #8 Jul 22 2025 23:44:50 %S A217965 9,17,91,321,1341,5269,21379,85633,344955,1386679,5579199,22440525, %T A217965 90271591,363117835,1460674773,5875648527,23635221447,95074256043, %U A217965 382442764281,1538402105163,6188327969265,24892972759953,100133687989929 %N A217965 Number of 2Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..2 2Xn array. %C A217965 Row 2 of A217964 %H A217965 R. H. Hardin, <a href="/A217965/b217965.txt">Table of n, a(n) for n = 1..129</a> %F A217965 Empirical: a(n) = 2*a(n-1) +7*a(n-2) +6*a(n-3) -2*a(n-4) -10*a(n-5) -11*a(n-6) -32*a(n-7) -23*a(n-8) -16*a(n-9) +22*a(n-10) +4*a(n-11) %e A217965 Some solutions for n=3 %e A217965 ..1..0..0....0..0..1....0..0..2....2..0..1....2..1..2....0..0..0....2..1..1 %e A217965 ..1..0..0....1..1..2....1..1..1....0..0..2....1..1..1....1..0..1....1..0..0 %K A217965 nonn %O A217965 1,1 %A A217965 _R. H. Hardin_ Oct 16 2012