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.

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

This page as a plain text file.
%I A220764 #6 Jul 23 2025 01:27:38
%S A220764 256,956,68212,548130,21154028,252705768,7140289348,106444390252,
%T A220764 2538132156370,42707545977344,928959886709234,16705185128697224,
%U A220764 345677236914253406,6446898251377310532,129826343410954387220
%N A220764 Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 4Xn array.
%C A220764 Row 4 of A220761
%H A220764 R. H. Hardin, <a href="/A220764/b220764.txt">Table of n, a(n) for n = 1..84</a>
%e A220764 Some solutions for n=3
%e A220764 ..1..0..0....2..1..3....3..0..0....2..0..2....0..0..2....1..0..3....1..1..1
%e A220764 ..2..0..3....1..0..2....0..0..0....3..0..0....1..0..1....0..0..0....1..0..2
%e A220764 ..0..0..0....0..0..0....0..0..3....2..0..2....3..1..3....0..0..2....0..0..1
%e A220764 ..0..0..1....2..0..1....1..0..2....1..1..1....2..1..1....2..0..3....1..0..0
%K A220764 nonn
%O A220764 1,1
%A A220764 _R. H. Hardin_ Dec 19 2012