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.

A220938 Equals two maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 4Xn array.

This page as a plain text file.
%I A220938 #5 Jul 23 2025 01:33:40
%S A220938 1,37,556,9107,172904,2876430,49406891
%N A220938 Equals two maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 4Xn array.
%C A220938 Row 4 of A220935
%e A220938 Some solutions for n=3
%e A220938 ..0..0..1....0..0..0....0..0..0....0..0..1....0..0..1....0..1..0....0..1..1
%e A220938 ..0..1..1....0..0..0....0..0..0....1..1..0....1..0..1....1..0..0....0..0..0
%e A220938 ..0..0..1....0..1..0....0..1..0....0..1..1....1..0..0....0..1..1....0..1..1
%e A220938 ..1..1..0....0..1..0....1..1..0....0..0..0....0..1..0....1..1..0....0..0..0
%K A220938 nonn
%O A220938 1,2
%A A220938 _R. H. Hardin_ Dec 25 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.