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.

A220762 Number of 2Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 2Xn array.

This page as a plain text file.
%I A220762 #6 Jul 23 2025 01:27:25
%S A220762 16,28,268,708,4766,15724,88434,331024,1683150,6777522,32549034,
%T A220762 136712744,635507042,2735089882,12478735816,54465787400,245847114384,
%U A220762 1081768683254,4852872926630,21453251299430,95899957070006
%N A220762 Number of 2Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 2Xn array.
%C A220762 Row 2 of A220761
%H A220762 R. H. Hardin, <a href="/A220762/b220762.txt">Table of n, a(n) for n = 1..210</a>
%F A220762 Empirical: a(n) = 2*a(n-1) +13*a(n-2) -10*a(n-3) +12*a(n-4) -41*a(n-5) +6*a(n-6) -16*a(n-7) -40*a(n-8) +4*a(n-9) +64*a(n-11) +32*a(n-12)
%e A220762 Some solutions for n=3
%e A220762 ..2..1..2....1..0..3....2..2..2....1..0..3....2..2..2....0..0..0....1..0..0
%e A220762 ..1..1..3....3..0..0....2..2..3....0..0..2....3..2..3....2..0..3....1..0..3
%K A220762 nonn
%O A220762 1,1
%A A220762 _R. H. Hardin_ Dec 19 2012