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.

Original entry on oeis.org

24, 1024, 32768, 1048576, 33546240, 1073741824, 34359738368, 1099510054912, 35184372088832, 1125899906842624, 36028796750528512, 1152921504606846976, 36893488147419103232, 1180591620674461630464, 37778931862957161709568
Offset: 1

Views

Author

R. H. Hardin Feb 18 2013

Keywords

Comments

Column 5 of A222386

Examples

			Some solutions for n=3
..0..1..1..0..0....1..0..1..0..0....0..0..0..1..1....0..1..0..0..1
..0..0..0..0..0....0..1..1..1..1....1..0..1..0..0....0..0..1..0..0
..0..0..1..1..0....1..0..0..0..1....0..0..1..1..0....1..1..0..0..0
		

Formula

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