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.

A220254 T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their king-move neighbors in a random 0..2 nXk array.

Original entry on oeis.org

2, 2, 2, 8, 16, 8, 16, 48, 48, 16, 24, 256, 324, 256, 24, 64, 928, 4096, 4096, 928, 64, 128, 4096, 31744, 45792, 31744, 4096, 128, 232, 15872, 262144, 1048576, 1048576, 262144, 15872, 232, 512, 65536, 2011776, 16777216, 33350528, 16777216, 2011776, 65536
Offset: 1

Views

Author

R. H. Hardin Dec 08 2012

Keywords

Comments

Table starts
....2......2........8........16.........24.........64.......128........232
....2.....16.......48.......256........928.......4096.....15872......65536
....8.....48......324......4096......31744.....262144...2011776...16728064
...16....256.....4096.....45792....1048576...16777216.268435456.4294967296
...24....928....31744...1048576...33350528.1073741824
...64...4096...262144..16777216.1073741824
..128..15872..2011776.268435456
..232..65536.16728064
..512.259584
.1024

Examples

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

Crossrefs

Column 1 is A220172