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.

A219072 Hilltop maps: number of n X n binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 n X n array.

This page as a plain text file.
%I A219072 #7 Jul 23 2025 00:12:27
%S A219072 1,11,337,32945,14228041,24734141495,167024618548071,
%T A219072 4450580094888603089,469651231165595918842913,
%U A219072 195869567064782965280559200707
%N A219072 Hilltop maps: number of n X n binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 n X n array.
%C A219072 Diagonal of A219078
%e A219072 Some solutions for n=3
%e A219072 ..0..1..1....0..0..1....1..1..0....1..0..1....0..0..1....1..1..0....1..1..0
%e A219072 ..0..0..1....1..1..0....1..1..0....0..0..1....1..1..1....0..1..0....0..0..0
%e A219072 ..1..1..0....0..1..1....0..1..1....1..1..1....1..1..0....0..0..1....1..0..1
%K A219072 nonn
%O A219072 1,2
%A A219072 _R. H. Hardin_ Nov 11 2012

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

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