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.

A217638 Number of n X n arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..2 n X n array.

This page as a plain text file.
%I A217638 #7 Jul 22 2025 23:41:52
%S A217638 3,9,163,8363,1348399,644993621,912173011699,3856478543303029,
%T A217638 48316904515484808101,1799376234322670301407483
%N A217638 Number of n X n arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..2 n X n array.
%C A217638 Diagonal of A217645
%e A217638 Some solutions for n=3
%e A217638 ..1..1..1....2..2..2....2..2..1....1..0..0....0..0..0....2..2..1....2..2..1
%e A217638 ..1..1..2....2..1..0....0..0..0....1..0..0....0..0..0....2..1..0....1..1..1
%e A217638 ..1..2..2....1..0..0....0..0..0....1..2..2....0..2..2....1..0..0....1..1..1
%K A217638 nonn
%O A217638 1,1
%A A217638 _R. H. Hardin_ Oct 09 2012

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.