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.

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

This page as a plain text file.
%I A220937 #5 Jul 23 2025 01:33:30
%S A220937 1,12,92,673,5912,48212,395844,3232729,26184472,211363254
%N A220937 Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 3Xn array.
%C A220937 Row 3 of A220935
%e A220937 Some solutions for n=3
%e A220937 ..0..0..1....0..0..1....0..0..1....0..1..1....0..1..1....0..0..0....0..1..0
%e A220937 ..0..0..1....1..0..0....1..0..1....0..1..1....0..0..0....0..1..0....1..0..0
%e A220937 ..1..1..0....0..1..0....0..0..0....0..0..0....0..0..0....0..1..0....0..1..0
%K A220937 nonn
%O A220937 1,2
%A A220937 _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.