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.

A221035 T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and antidiagonal neighbors in a random 0..2 nXk array.

Original entry on oeis.org

1, 2, 1, 4, 7, 1, 7, 33, 21, 1, 12, 119, 228, 65, 1, 21, 457, 1733, 1561, 200, 1, 37, 1710, 14277, 24485, 10648, 616, 1, 65, 6466, 110506, 419506, 345755, 72625, 1897, 1, 114, 24433, 870027, 6637755, 12239631, 4882030, 495329, 5842, 1, 200, 92196, 6717882
Offset: 1

Views

Author

R. H. Hardin Dec 29 2012

Keywords

Comments

Table starts
.1......2.........4...........7...........12............21............37
.1......7........33.........119..........457..........1710..........6466
.1.....21.......228........1733........14277........110506........870027
.1.....65......1561.......24485.......419506.......6637755.....106761517
.1....200.....10648......345755.....12239631.....393788081...12843452050
.1....616.....72625.....4882030....356411031...23287585899.1537391091350
.1...1897....495329....68933905..10373626389.1376083439034
.1...5842...3378333...973340015.301896920812
.1..17991..23041525.13743460075
.1..55405.157152036
.1.170625
.1

Examples

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

Crossrefs

Column 2 is A218836
Row 1 is A005251(n+2)