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.

A222935 T(n,k)=Sum of neighbor maps: number of nXk 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 nXk array.

Original entry on oeis.org

2, 2, 4, 8, 16, 8, 16, 48, 64, 16, 24, 256, 512, 232, 32, 64, 1024, 4000, 4096, 1024, 64, 128, 4096, 32760, 63488, 32768, 4096, 128, 232, 15820, 262104, 1047664, 1048352, 262144, 16224, 256, 512, 65536, 2097152, 16776992, 33553920, 16777216, 2097152
Offset: 1

Views

Author

R. H. Hardin Mar 09 2013

Keywords

Comments

Table starts
....2.......2.........8.........16..........24..........64.........128
....4......16........48........256........1024........4096.......15820
....8......64.......512.......4000.......32760......262104.....2097152
...16.....232......4096......63488.....1047664....16776992...268435456
...32....1024.....32768....1048352....33553920..1073741824.34358569712
...64....4096....262144...16777216..1073741824.68719413208
..128...16224...2097152..268435456.34359738368
..256...65536..16777216.4294962688
..512..262144.134217728
.1024.1047680
.2048

Examples

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

Crossrefs

Column 1 is A000079
Column 2 is A222381
Column 3 is A001018 except for a(2)
Row 1 is A220172