cp's OEIS Frontend

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.

A218062 Number of nX6 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 nX6 array.

This page as a plain text file.
%I A218062 #6 Jul 22 2025 23:47:28
%S A218062 16,268,3974,60804,925904,14096488,214514380,3263893360,49658510202,
%T A218062 755518606946,11494629017172,174881679122376,2660685599023984,
%U A218062 40480211800235302,615874165289837908,9370034622516193552
%N A218062 Number of nX6 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 nX6 array.
%C A218062 Column 6 of A218064
%H A218062 R. H. Hardin, <a href="/A218062/b218062.txt">Table of n, a(n) for n = 1..72</a>
%F A218062 Empirical: a(n) = 26*a(n-1) -199*a(n-2) +527*a(n-3) +257*a(n-4) -3086*a(n-5) +918*a(n-6) +11050*a(n-7) -6781*a(n-8) -25737*a(n-9) +23534*a(n-10) +29646*a(n-11) -36015*a(n-12) -15207*a(n-13) +25338*a(n-14) +2853*a(n-15) -8912*a(n-16) +2728*a(n-17) -200*a(n-18) +36*a(n-19) -16*a(n-20) for n>21
%e A218062 Some solutions for n=3
%e A218062 ..0..0..0..0..0..0....1..0..0..0..0..0....1..1..0..0..0..0....1..1..0..0..0..1
%e A218062 ..0..1..0..0..1..0....0..0..1..1..0..0....1..1..0..0..0..0....1..1..0..0..0..1
%e A218062 ..1..1..1..0..0..0....0..0..0..0..0..1....1..1..1..1..0..1....1..1..0..0..0..0
%K A218062 nonn
%O A218062 1,1
%A A218062 _R. H. Hardin_ Oct 19 2012