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.

A219468 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX5 array.

This page as a plain text file.
%I A219468 #6 Jul 23 2025 00:29:50
%S A219468 35,547,28159,1227441,43792361,1357658929,37552353044,947150536824,
%T A219468 22129769822973,483036569368799,9904217535401123,191717483791553680,
%U A219468 3519902109176030571,61551065872538233732,1028861754560712576407
%N A219468 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX5 array.
%C A219468 Column 5 of A219471
%H A219468 R. H. Hardin, <a href="/A219468/b219468.txt">Table of n, a(n) for n = 1..84</a>
%e A219468 Some solutions for n=3
%e A219468 ..1..1..2..2..2....0..0..1..1..1....2..2..2..0..0....0..0..1..0..2
%e A219468 ..2..2..2..2..2....1..1..1..0..0....2..0..0..0..0....1..0..0..0..1
%e A219468 ..3..3..2..2..3....1..3..1..0..2....1..0..0..2..3....0..0..0..1..3
%K A219468 nonn
%O A219468 1,1
%A A219468 _R. H. Hardin_ Nov 20 2012