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.

A183550 Number of nX5 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 A183550 #7 Jul 22 2025 09:05:27
%S A183550 15,1325,46841,1728533,63868351,2359134621,87176303417,3221377019429,
%T A183550 119037100116183,4398697422258081,162542044954494221,
%U A183550 6006305685720331925,221946939432242106215,8201454756620862955585,303062796878789833114397
%N A183550 Number of nX5 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
%C A183550 Column 5 of A183554
%H A183550 R. H. Hardin, <a href="/A183550/b183550.txt">Table of n, a(n) for n = 1..200</a>
%e A183550 Some solutions for 3X5
%e A183550 ..1..1..0..0..1....2..2..2..0..0....0..0..1..1..1....1..1..0..0..0
%e A183550 ..0..0..0..0..1....2..2..1..2..2....0..1..0..2..2....0..0..2..0..1
%e A183550 ..1..1..0..1..1....0..0..1..1..2....1..1..0..0..2....2..2..2..2..1
%K A183550 nonn
%O A183550 1,1
%A A183550 _R. H. Hardin_ Jan 05 2011