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.

A221443 Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 nX5 array.

This page as a plain text file.
%I A221443 #6 Jul 23 2025 01:56:01
%S A221443 17,429,10593,260557,6415089,157933741,3888200065,95724317069,
%T A221443 2356654610641,58018914711981,1428378365629601,35165510520296269,
%U A221443 865746191545503153,21313965220121585837,524732442187736997569
%N A221443 Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 nX5 array.
%C A221443 Column 5 of A221446
%H A221443 R. H. Hardin, <a href="/A221443/b221443.txt">Table of n, a(n) for n = 1..210</a>
%F A221443 Empirical: a(n) = 17*a(n-1) +168*a(n-2) +464*a(n-3) +442*a(n-4) +30*a(n-5) -88*a(n-6) -9*a(n-8) +a(n-9)
%e A221443 Some solutions for n=3
%e A221443 ..1..1..0..0..1....1..1..1..1..1....0..1..1..1..1....0..1..1..0..1
%e A221443 ..0..1..1..0..1....0..1..0..1..1....1..0..0..1..1....1..0..1..1..0
%e A221443 ..1..1..1..0..1....1..1..1..1..0....1..0..1..0..1....1..0..0..1..1
%K A221443 nonn
%O A221443 1,1
%A A221443 _R. H. Hardin_ Jan 17 2013