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.

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

This page as a plain text file.
%I A222932 #7 Jul 23 2025 03:17:17
%S A222932 16,256,4000,63488,1048352,16777216,268435456,4294962688,68702699520,
%T A222932 1099511601152,17592186044416,281474976710656,4503599627247616,
%U A222932 72057490958712832,1152921504604356608,18446744073709551616
%N A222932 Sum of neighbor maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal and antidiagonal neighbors in a random 0..3 nX4 array.
%C A222932 Column 4 of A222935
%H A222932 R. H. Hardin, <a href="/A222932/b222932.txt">Table of n, a(n) for n = 1..210</a>
%F A222932 Empirical: a(n) = 16*a(n-1) +8352*a(n-5) -133632*a(n-6) -18096384*a(n-10) +289542144*a(n-11) +2753724416*a(n-15) -44059590656*a(n-16) -143077146624*a(n-20) +2289234345984*a(n-21) +2757369004032*a(n-25) -44117904064512*a(n-26) -17592186044416*a(n-30) +281474976710656*a(n-31)
%e A222932 Some solutions for n=3
%e A222932 ..1..0..1..0....0..1..0..1....1..1..0..1....0..0..1..0....0..1..0..1
%e A222932 ..0..1..0..0....1..0..0..1....0..0..1..1....0..1..0..0....0..1..1..1
%e A222932 ..0..1..0..0....0..0..0..0....0..0..0..0....1..1..0..0....1..0..0..1
%K A222932 nonn
%O A222932 1,1
%A A222932 _R. H. Hardin_ Mar 09 2013