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.

A183551 Number of nX6 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 A183551 #7 Jul 22 2025 09:05:34
%S A183551 33,5845,417809,31363527,2359134621,177385265619,13344696858771,
%T A183551 1003889179688773,75519989933088273,5681183354145927001,
%U A183551 427381397089550672209,32150852268908799128175,2418629680159299544090603
%N A183551 Number of nX6 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
%C A183551 Column 6 of A183554
%H A183551 R. H. Hardin, <a href="/A183551/b183551.txt">Table of n, a(n) for n = 1..95</a>
%e A183551 Some solutions for 3X6
%e A183551 ..0..1..0..1..1..1....0..0..2..2..1..1....0..0..0..2..2..2....0..0..1..1..2..2
%e A183551 ..0..1..0..0..1..0....0..2..2..0..2..0....0..0..2..2..1..2....0..1..1..2..2..2
%e A183551 ..1..1..0..0..0..0....1..1..2..0..2..0....2..2..0..0..1..1....1..1..1..1..1..1
%K A183551 nonn
%O A183551 1,1
%A A183551 _R. H. Hardin_ Jan 05 2011