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.

A254173 Number of (6+2)X(n+2) 0..1 arrays with every 3X3 subblock diagonal maximum minus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.

This page as a plain text file.
%I A254173 #6 Jul 23 2025 14:30:03
%S A254173 1511152,36538548,1054310240,31143715804,886761490936,24789263869340,
%T A254173 684072377169008,18738106424812380,512823923719769272,
%U A254173 14030281670008005564,383831267774223029112,10500422875690342522680
%N A254173 Number of (6+2)X(n+2) 0..1 arrays with every 3X3 subblock diagonal maximum minus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.
%C A254173 Row 6 of A254168
%H A254173 R. H. Hardin, <a href="/A254173/b254173.txt">Table of n, a(n) for n = 1..210</a>
%e A254173 Some solutions for n=1
%e A254173 ..0..0..0....0..0..0....0..0..0....0..0..0....1..0..0....0..0..0....0..0..0
%e A254173 ..0..0..1....0..0..0....1..0..1....1..0..1....1..0..0....0..0..1....0..1..0
%e A254173 ..1..1..0....0..1..0....0..1..0....1..1..0....0..0..0....1..1..0....1..0..0
%e A254173 ..0..1..1....1..0..1....0..0..0....1..1..0....1..1..0....1..1..1....0..1..0
%e A254173 ..1..1..1....1..1..0....0..0..0....1..0..0....0..0..0....1..1..0....1..1..0
%e A254173 ..0..0..0....1..1..0....1..0..0....1..1..1....0..1..0....0..0..0....0..0..1
%e A254173 ..0..0..0....1..0..0....0..0..0....0..0..1....0..0..0....0..1..1....1..0..0
%e A254173 ..0..0..1....0..0..0....0..0..0....0..0..0....1..1..1....0..1..1....0..1..1
%K A254173 nonn
%O A254173 1,1
%A A254173 _R. H. Hardin_, Jan 26 2015