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.

A221446 T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 nXk array.

Original entry on oeis.org

1, 3, 1, 5, 9, 1, 9, 33, 31, 1, 17, 117, 221, 105, 1, 31, 429, 1465, 1473, 355, 1, 57, 1577, 10593, 18393, 9829, 1201, 1, 105, 5785, 76055, 260557, 230845, 65569, 4063, 1, 193, 21217, 543081, 3669101, 6415089, 2897357, 437437, 13745, 1, 355, 77825, 3883061
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Table starts
.1.......3..........5..............9................17....................31
.1.......9.........33............117...............429..................1577
.1......31........221...........1465.............10593.................76055
.1.....105.......1473..........18393............260557...............3669101
.1.....355.......9829.........230845...........6415089.............177320895
.1....1201......65569........2897357.........157933741............8569227073
.1....4063.....437437.......36364977........3888200065..........414116287743
.1...13745....2918273......456419681.......95724317069........20012580804813
.1...46499...19468741.....5728560373.....2356654610641.......967127817426727
.1..157305..129882145....71899621813....58018914711981.....46737411242830049
.1..532159..866485149...902417942313..1428378365629601...2258631763028702151
.1.1800281.5780598081.11326320232169.35165510520296269.109150620595639469645

Examples

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

Crossrefs

Row 1 is A000213(n+1)