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 A217979 #6 Jul 22 2025 23:45:41 %S A217979 10,10,100,362,1942,8872,43258,205446,986288,4714274,22573862, %T A217979 108013892,516992146,2474201538,11841537864,56672476422,271231398802, %U A217979 1298094250056,6212595977182,29733069165822,142300516403984,681040858862718 %N A217979 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random 0..1 nX5 array. %C A217979 Column 5 of A217982 %H A217979 R. H. Hardin, <a href="/A217979/b217979.txt">Table of n, a(n) for n = 1..53</a> %F A217979 Empirical: a(n) = 3*a(n-1) +10*a(n-2) +a(n-3) -28*a(n-4) -58*a(n-5) +41*a(n-6) +39*a(n-7) -50*a(n-8) -9*a(n-9) +100*a(n-10) +368*a(n-11) -439*a(n-12) -51*a(n-13) +370*a(n-14) -249*a(n-15) -56*a(n-16) +106*a(n-17) -33*a(n-18) -7*a(n-19) +6*a(n-20) +a(n-21) %e A217979 Some solutions for n=3 %e A217979 ..1..1..1..0..0....1..1..0..0..0....1..1..0..0..0....1..0..0..0..0 %e A217979 ..0..0..1..0..0....1..0..0..0..0....1..0..0..0..0....1..0..0..0..0 %e A217979 ..0..0..1..1..1....1..0..0..0..0....1..0..0..0..1....1..1..1..1..1 %K A217979 nonn %O A217979 1,1 %A A217979 _R. H. Hardin_ Oct 16 2012