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.

Showing 1-7 of 7 results.

A222386 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 horizontal and antidiagonal neighbors in a random 0..2 nXk array.

Original entry on oeis.org

2, 2, 4, 8, 16, 8, 16, 48, 64, 16, 24, 248, 512, 232, 32, 64, 1024, 3968, 3968, 1024, 64, 128, 3968, 32768, 63488, 32768, 4096, 128, 232, 15872, 262144, 1048576, 1048320, 261376, 16224, 256, 512, 65536, 2093824, 16776896, 33546240, 16777216, 2097152
Offset: 1

Views

Author

R. H. Hardin Feb 18 2013

Keywords

Comments

Table starts
....2.......2.........8.........16..........24..........64.........128
....4......16........48........248........1024........3968.......15872
....8......64.......512.......3968.......32768......262144.....2093824
...16.....232......3968......63488.....1048576....16776896...268369920
...32....1024.....32768....1048320....33546240..1073741712.34359738368
...64....4096....261376...16777216..1073741824.68719469568
..128...16224...2097152..268435072.34359738368
..256...65536..16773120.4294961152
..512..262144.134217728
.1024.1047680
.2048

Examples

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

Crossrefs

Column 1 is A000079
Row 1 is A220172

A221072 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 king-move neighbors in a random 0..3 nXk array.

Original entry on oeis.org

2, 2, 2, 8, 8, 8, 16, 20, 20, 16, 24, 56, 512, 56, 24, 64, 168, 4096, 4096, 168, 64, 128, 476, 26976, 65536, 26976, 476, 128, 232, 1364, 262144, 829184, 829184, 262144, 1364, 232, 512, 3952, 2097152, 16777216, 17530176, 16777216, 2097152, 3952, 512, 1024, 11360
Offset: 1

Views

Author

R. H. Hardin Dec 31 2012

Keywords

Comments

Table starts
....2.....2.........8.........16..........24..........64.........128........232
....2.....8........20.........56.........168.........476........1364.......3952
....8....20.......512.......4096.......26976......262144.....2097152...16401664
...16....56......4096......65536......829184....16777216...268435456.4185880576
...24...168.....26976.....829184....17530176...811440640.25241048576
...64...476....262144...16777216...811440640.68719476736
..128..1364...2097152..268435456.25241048576
..232..3952..16401664.4185880576
..512.11360.134217728
.1024.32692
.1984

Examples

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

Crossrefs

Column 1 is A220172

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

A221666 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 horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array.

Original entry on oeis.org

2, 2, 4, 8, 12, 8, 16, 64, 48, 16, 24, 256, 512, 256, 32, 64, 992, 3772, 3772, 856, 64, 128, 4096, 31744, 63200, 32768, 4096, 128, 232, 16384, 262144, 1048576, 1048576, 262144, 15872, 256, 512, 65344, 2097152, 16777216, 33421056, 16777216, 2097152, 65344
Offset: 1

Views

Author

R. H. Hardin Jan 21 2013

Keywords

Comments

Table starts
....2......2........8........16.........24.........64.......128........232
....4.....12.......64.......256........992.......4096.....16384......65344
....8.....48......512......3772......31744.....262144...2097152...16728064
...16....256.....3772.....63200....1048576...16777216.268281856.4294967296
...32....856....32768...1048576...33421056.1073741824
...64...4096...262144..16777216.1073741824
..128..15872..2097152.268281856
..256..65344.16777216
..512.259584
.1024

Examples

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

Crossrefs

Column 1 is A000079
Row 1 is A220172

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

A220805 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 vertical neighbors in a random 0..3 nXk array.

Original entry on oeis.org

2, 2, 2, 8, 16, 8, 16, 48, 48, 16, 24, 256, 512, 256, 24, 64, 928, 4096, 4096, 928, 64, 128, 4096, 30766, 62648, 30766, 4096, 128, 232, 15820, 262144, 1048576, 1048576, 262144, 15820, 232, 512, 65536, 2097152, 16777216, 33358976, 16777216, 2097152, 65536
Offset: 1

Views

Author

R. H. Hardin Dec 21 2012

Keywords

Comments

Table starts
....2......2........8........16.........24.........64.........128........232
....2.....16.......48.......256........928.......4096.......15820......65536
....8.....48......512......4096......30766.....262144.....2097152...16728064
...16....256.....4096.....62648....1048576...16777216...268435456.4294967296
...24....928....30766...1048576...33358976.1073741824.34348186888
...64...4096...262144..16777216.1073741824
..128..15820..2097152.268435456
..232..65536.16728064
..512.259584
.1024

Examples

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

Crossrefs

Column 1 is A220172

A222448 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, vertical and antidiagonal neighbors in a random 0..3 nXk array.

Original entry on oeis.org

2, 2, 2, 8, 14, 8, 16, 64, 64, 16, 24, 210, 420, 210, 24, 64, 1024, 4056, 4056, 1024, 64, 128, 4000, 32720, 65536, 32720, 4000, 128, 232, 16288, 262104, 1048576, 1048576, 262104, 16288, 232, 512, 65536, 2082688, 16750154, 33553664, 16750154, 2082688
Offset: 1

Views

Author

R. H. Hardin Feb 20 2013

Keywords

Comments

Table starts
....2......2........8........16.........24.........64.........128........232
....2.....14.......64.......210.......1024.......4000.......16288......65536
....8.....64......420......4056......32720.....262104.....2082688...16777216
...16....210.....4056.....65536....1048576...16750154...268430848.4294967008
...24...1024....32720...1048576...33553664.1073741824.34359738368
...64...4000...262104..16750154.1073741824
..128..16288..2082688.268430848
..232..65536.16777216
..512.260080
.1024

Examples

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

Crossrefs

Column 1 is A220172
Showing 1-7 of 7 results.