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.

A183583 Half the number of nX8 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 A183583 #6 Jul 22 2025 09:06:39
%S A183583 194,354615,171459557,92915045150,49526167251643,26548571098836075,
%T A183583 14217486118795912134
%N A183583 Half the number of nX8 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
%C A183583 Column 8 of A183584
%e A183583 Some solutions with a(1,1)<=1 for 3X8
%e A183583 ..0..0..0..0..1..1..0..0....0..0..0..3..3..0..0..0....0..0..0..0..0..0..3..3
%e A183583 ..0..0..0..1..1..1..1..1....0..0..0..0..3..0..0..2....0..0..0..1..0..3..3..3
%e A183583 ..0..0..0..1..1..0..0..1....0..0..0..0..3..0..0..2....0..0..0..1..1..1..1..1
%K A183583 nonn
%O A183583 1,1
%A A183583 _R. H. Hardin_ Jan 05 2011