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.

A183581 Half the number of nX6 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 A183581 #7 Jul 22 2025 09:06:32
%S A183581 38,12024,1282814,149355515,17195908538,1988200387149,229716738097391,
%T A183581 26548571098836075,3068082753691026342,354569738678873849813,
%U A183581 40976532204608285387767,4735538672860090875422373
%N A183581 Half the number of nX6 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
%C A183581 Column 6 of A183584
%H A183581 R. H. Hardin, <a href="/A183581/b183581.txt">Table of n, a(n) for n = 1..18</a>
%e A183581 Some solutions with a(1,1)<=1 for 3X6
%e A183581 ..0..0..2..2..1..3....0..0..0..3..3..3....0..0..1..0..0..0....0..0..2..2..3..1
%e A183581 ..0..1..1..1..1..3....0..2..0..3..3..2....0..1..1..1..0..0....0..0..0..3..3..1
%e A183581 ..1..1..1..2..2..2....0..2..2..2..3..2....1..1..1..1..1..1....0..0..2..2..3..1
%K A183581 nonn
%O A183581 1,1
%A A183581 _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.