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.

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

This page as a plain text file.
%I A220333 #5 Jul 23 2025 01:04:17
%S A220333 1,351,15316,876714,46094354,2680626797
%N A220333 Equals two maps: number of 6Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 6Xn array.
%C A220333 Row 6 of A220328
%e A220333 Some solutions for n=3
%e A220333 ..0..0..0....0..0..1....0..0..0....0..1..0....0..1..0....0..1..0....0..0..0
%e A220333 ..0..0..1....1..0..0....0..0..0....0..0..1....1..1..1....0..1..0....1..0..0
%e A220333 ..1..0..0....0..0..0....0..1..1....1..0..0....0..1..1....1..1..1....0..1..1
%e A220333 ..0..0..0....0..0..0....1..0..0....0..1..1....0..1..1....0..1..1....1..0..1
%e A220333 ..0..0..0....0..1..0....0..1..0....0..1..0....0..0..0....0..1..0....0..1..1
%e A220333 ..1..1..0....0..0..0....0..1..0....1..0..0....0..1..0....0..1..0....0..0..0
%K A220333 nonn
%O A220333 1,2
%A A220333 _R. H. Hardin_ Dec 10 2012