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.

A237571 Number of (n+1)X(3+1) 0..3 arrays with the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.

This page as a plain text file.
%I A237571 #6 Jul 23 2025 10:19:00
%S A237571 13924,315664,7379204,173478980,4093774632,95639726868,2255748816966,
%T A237571 52746091216472,1244121688354740,29088796774026344,686098112079186338,
%U A237571 16041540535482336896,378367591142818627910,8846617965689182153740
%N A237571 Number of (n+1)X(3+1) 0..3 arrays with the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.
%C A237571 Column 3 of A237574
%H A237571 R. H. Hardin, <a href="/A237571/b237571.txt">Table of n, a(n) for n = 1..210</a>
%e A237571 Some solutions for n=1
%e A237571 ..2..1..1..1....2..3..2..1....0..0..1..1....2..1..1..2....1..0..1..1
%e A237571 ..2..2..2..1....0..2..3..2....2..0..1..0....3..0..2..0....1..3..0..1
%K A237571 nonn
%O A237571 1,1
%A A237571 _R. H. Hardin_, Feb 09 2014