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.

A238319 Number of (n+1) X (4+1) 0..2 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.

This page as a plain text file.
%I A238319 #6 Oct 19 2021 22:00:48
%S A238319 51,1867,41046,721939,13265123,261676376,5206684654,102053610873,
%T A238319 1987295524193,38770223731701,758012281434166,14822685184195262,
%U A238319 289709710098420174,5661329642092072222,110637907561833470425
%N A238319 Number of (n+1) X (4+1) 0..2 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.
%C A238319 Column 4 of A238323.
%H A238319 R. H. Hardin, <a href="/A238319/b238319.txt">Table of n, a(n) for n = 1..210</a>
%e A238319 Some solutions for n=3
%e A238319 ..1..2..2..2..2....2..2..2..1..1....1..2..2..2..1....1..1..1..0..0
%e A238319 ..0..0..0..0..0....0..2..2..1..0....0..1..1..1..1....1..1..0..0..0
%e A238319 ..0..0..0..0..0....0..0..1..1..0....0..1..1..1..1....1..1..0..0..0
%e A238319 ..0..0..0..2..2....0..0..1..1..0....0..2..2..2..1....1..2..2..1..0
%Y A238319 Cf. A238323.
%K A238319 nonn
%O A238319 1,1
%A A238319 _R. H. Hardin_, Feb 24 2014