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.

A183579 Half the number of nX4 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

This page as a plain text file.
%I A183579 #7 Jul 22 2025 09:06:18
%S A183579 8,407,9667,240358,5987795,149355515,3724940988,92915045150,
%T A183579 2317648165893,57811518197886,1442053664104187,35970710709296927,
%U A183579 897256757776720016,22381259751777880373,558280348730102033060
%N A183579 Half the number of nX4 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
%C A183579 Column 4 of A183584
%H A183579 R. H. Hardin, <a href="/A183579/b183579.txt">Table of n, a(n) for n = 1..200</a>
%e A183579 Some solutions with a(1,1)<=1 for 3X4
%e A183579 ..0..0..2..1....1..1..1..1....1..1..1..1....1..3..1..1....0..0..1..1
%e A183579 ..1..0..2..1....1..3..1..1....0..0..2..2....1..3..3..1....1..1..1..1
%e A183579 ..1..0..2..2....1..3..3..1....0..0..0..2....2..2..3..3....1..0..0..1
%K A183579 nonn
%O A183579 1,1
%A A183579 _R. H. Hardin_ Jan 05 2011