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.
%I A222933 #6 Jul 23 2025 03:17:24 %S A222933 24,1024,32760,1047664,33553920,1073741824,34359738368,1099511627776, %T A222933 35184372088448,1125899904556032,36028797018701824, %U A222933 1152921504606846976,36893488147419103232,1180591620717411303424,37778931862957161699328 %N A222933 Sum of neighbor maps: number of nX5 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 nX5 array. %C A222933 Column 5 of A222935 %H A222933 R. H. Hardin, <a href="/A222933/b222933.txt">Table of n, a(n) for n = 1..210</a> %F A222933 Empirical: a(n) = 32*a(n-1) +2720*a(n-6) -87040*a(n-7) -2580736*a(n-12) +82583552*a(n-13) +1038909440*a(n-18) -33245102080*a(n-19) -194784526336*a(n-24) +6233104842752*a(n-25) +17021492264960*a(n-30) -544687752478720*a(n-31) -692761044975616*a(n-36) +22168353439219712*a(n-37) +11962686510202880*a(n-42) -382805968326492160*a(n-43) -72057594037927936*a(n-48) +2305843009213693952*a(n-49) for n>50 %e A222933 Some solutions for n=3 %e A222933 ..1..0..1..1..1....1..0..0..1..0....0..0..0..1..1....1..0..1..0..1 %e A222933 ..1..1..0..1..0....1..1..0..1..0....0..1..1..1..0....0..0..1..1..1 %e A222933 ..0..1..1..1..1....0..1..0..1..0....0..1..0..0..1....1..1..1..1..0 %K A222933 nonn %O A222933 1,1 %A A222933 _R. H. Hardin_ Mar 09 2013