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.

A183552 Number of nX7 0..2 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 A183552 #7 Jul 22 2025 09:05:42
%S A183552 63,25785,3721925,569461759,87176303417,13344696858771,
%T A183552 2043774880960645,313000943874975793,47935484320796681363,
%U A183552 7341240634658342843595,1124298676282804824274345,172184481387904369618417369
%N A183552 Number of nX7 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
%C A183552 Column 7 of A183554
%H A183552 R. H. Hardin, <a href="/A183552/b183552.txt">Table of n, a(n) for n = 1..18</a>
%e A183552 Some solutions for 3X7
%e A183552 ..0..0..1..1..1..1..2....0..0..2..2..2..2..1....0..0..1..0..0..0..2
%e A183552 ..0..0..1..0..2..2..2....0..0..0..2..2..1..1....0..0..1..1..1..0..2
%e A183552 ..0..0..1..0..2..2..2....0..0..2..2..2..2..2....0..0..0..0..1..0..0
%K A183552 nonn
%O A183552 1,1
%A A183552 _R. H. Hardin_ Jan 05 2011