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.

A183553 Number of nX8 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 A183553 #6 Jul 22 2025 09:05:49
%S A183553 129,113841,33169105,10339213765,3221377019429,1003889179688773,
%T A183553 313000943874975793,97587614786720584857
%N A183553 Number of nX8 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
%C A183553 Column 8 of A183554
%e A183553 Some solutions for 3X8
%e A183553 ..0..0..0..2..2..1..2..2....0..0..0..0..1..0..2..2....0..0..0..1..1..0..0..0
%e A183553 ..0..0..0..2..2..1..1..2....0..0..0..1..1..0..0..2....0..0..0..0..0..0..0..0
%e A183553 ..0..0..0..2..2..2..1..2....0..0..0..0..1..1..0..0....0..0..0..2..2..2..2..0
%K A183553 nonn
%O A183553 1,1
%A A183553 _R. H. Hardin_ Jan 05 2011

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.