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.

A222389 Sum of neighbor maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their horizontal and antidiagonal neighbors in a random 0..2 4Xn array.

This page as a plain text file.
%I A222389 #5 Jul 23 2025 02:33:57
%S A222389 16,232,3968,63488,1048576,16776896,268369920,4294961152,68702608704,
%T A222389 1099511627776,17592160878592,281474976700416,4503599627370496
%N A222389 Sum of neighbor maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their horizontal and antidiagonal neighbors in a random 0..2 4Xn array.
%C A222389 Row 4 of A222386
%e A222389 Some solutions for n=3
%e A222389 ..0..1..0....1..0..1....1..1..1....1..1..0....1..0..1....1..0..0....0..1..0
%e A222389 ..0..1..0....0..0..0....1..0..1....1..0..1....1..0..0....0..1..1....0..0..1
%e A222389 ..0..0..0....1..1..0....0..1..0....1..0..1....0..0..1....0..1..0....1..1..0
%e A222389 ..0..0..0....0..1..1....1..0..1....1..1..1....1..1..0....1..0..1....1..1..1
%K A222389 nonn
%O A222389 1,1
%A A222389 _R. H. Hardin_ Feb 18 2013

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

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