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.

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

This page as a plain text file.
%I A237329 #6 Jul 23 2025 10:05:28
%S A237329 20692,242644,2870224,36921568,449909120,5467718444,67160833084,
%T A237329 873971263352,10725570823166,130884937973764,1618592687351532,
%U A237329 21304964466254580,262963526810931008,3219057124873502360
%N A237329 Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.
%C A237329 Column 5 of A237332
%H A237329 R. H. Hardin, <a href="/A237329/b237329.txt">Table of n, a(n) for n = 1..152</a>
%e A237329 Some solutions for n=1
%e A237329 ..2..1..2..0..2..0....2..2..0..2..1..1....2..1..2..2..0..1....1..1..2..0..0..0
%e A237329 ..2..1..1..1..2..0....0..1..1..0..1..2....2..0..1..2..2..2....0..0..0..0..1..1
%K A237329 nonn
%O A237329 1,1
%A A237329 _R. H. Hardin_, Feb 06 2014