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.

A220573 Equals one maps: number of n X n binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 n X n array.

This page as a plain text file.
%I A220573 #7 Jul 23 2025 01:14:20
%S A220573 1,8,91,17505,3162375,4239598056,12835487766480
%N A220573 Equals one maps: number of n X n binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 n X n array.
%C A220573 Diagonal of A220579
%e A220573 Some solutions for n=3
%e A220573 ..0..0..1....0..1..0....0..0..1....1..1..1....1..0..0....0..1..1....1..1..1
%e A220573 ..1..1..1....0..0..0....1..1..0....1..0..1....0..1..1....1..1..1....1..0..0
%e A220573 ..1..0..1....0..1..0....0..1..0....1..1..1....1..0..0....1..0..1....0..1..1
%K A220573 nonn
%O A220573 1,2
%A A220573 _R. H. Hardin_ Dec 16 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.