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.

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

Original entry on oeis.org

1, 3, 3, 5, 13, 5, 9, 49, 49, 9, 17, 191, 357, 191, 17, 31, 737, 2725, 2725, 737, 31, 57, 2849, 20793, 41515, 20793, 2849, 57, 105, 11011, 158429, 629659, 629659, 158429, 11011, 105, 193, 42557, 1207525, 9539915, 19003811, 9539915, 1207525, 42557, 193
Offset: 1

Views

Author

R. H. Hardin Oct 28 2012

Keywords

Comments

Table starts
....1.......3...........5...............9.................17
....3......13..........49.............191................737
....5......49.........357............2725..............20793
....9.....191........2725...........41515.............629659
...17.....737.......20793..........629659...........19003811
...31....2849......158429.........9539915..........572765605
...57...11011.....1207525.......144597047........17270172871
..105...42557.....9203377......2191517757.......520703946625
..193..164481....70144889.....33214850067.....15699497444771
..355..635711...534620525....503408006597....473348740584743
..653.2456993..4074695269...7629705089721..14271727157207365
.1201.9496161.31055936969.115636627121941.430300515162577777

Examples

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

Crossrefs

Column 1 is A000213(n+1)