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.

A237388 Number of (n+1) X (4+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2 X 2 subblock.

This page as a plain text file.
%I A237388 #6 Jun 26 2025 12:31:23
%S A237388 12624,183764,2712486,41204198,629612266,9678405410,148794944054,
%T A237388 2283761004002,34983096932494,536585050368130,8240252282574750,
%U A237388 126487165848399856,1940113960361065176,29764767650582758670
%N A237388 Number of (n+1) X (4+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2 X 2 subblock.
%C A237388 Column 4 of A237391.
%H A237388 R. H. Hardin, <a href="/A237388/b237388.txt">Table of n, a(n) for n = 1..210</a>
%e A237388 Some solutions for n=2
%e A237388 ..0..1..1..1..1....0..1..0..2..1....1..0..2..2..0....0..2..2..1..2
%e A237388 ..1..2..1..1..2....0..0..1..0..2....1..1..0..0..1....1..1..0..1..1
%e A237388 ..0..2..1..2..0....0..0..0..1..1....0..2..2..0..0....1..0..2..2..0
%Y A237388 Cf. A237391.
%K A237388 nonn
%O A237388 1,1
%A A237388 _R. H. Hardin_, Feb 07 2014