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.

A222384 Sum of neighbor maps: number of nX5 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 nX5 array.

This page as a plain text file.
%I A222384 #6 Jul 23 2025 02:33:24
%S A222384 24,1024,32768,1048576,33546240,1073741824,34359738368,1099510054912,
%T A222384 35184372088832,1125899906842624,36028796750528512,
%U A222384 1152921504606846976,36893488147419103232,1180591620674461630464,37778931862957161709568
%N A222384 Sum of neighbor maps: number of nX5 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 nX5 array.
%C A222384 Column 5 of A222386
%H A222384 R. H. Hardin, <a href="/A222384/b222384.txt">Table of n, a(n) for n = 1..210</a>
%F A222384 Empirical: a(n) = 32*a(n-1) +256*a(n-3) -8192*a(n-4) -16384*a(n-6) +524288*a(n-7) for n>9
%e A222384 Some solutions for n=3
%e A222384 ..0..1..1..0..0....1..0..1..0..0....0..0..0..1..1....0..1..0..0..1
%e A222384 ..0..0..0..0..0....0..1..1..1..1....1..0..1..0..0....0..0..1..0..0
%e A222384 ..0..0..1..1..0....1..0..0..0..1....0..0..1..1..0....1..1..0..0..0
%K A222384 nonn
%O A222384 1,1
%A A222384 _R. H. Hardin_ Feb 18 2013