login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A219063
T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array
12
1, 3, 1, 7, 15, 1, 13, 63, 59, 1, 25, 249, 503, 233, 1, 49, 993, 4049, 4017, 929, 1, 97, 3969, 32313, 64577, 32123, 3697, 1, 191, 15867, 258353, 1030457, 1032785, 256849, 14719, 1, 375, 63423, 2066359, 16477441, 32958333, 16520553, 2053803, 58599, 1, 737
OFFSET
1,2
COMMENTS
Table starts
.1........3...........7..............13................25..................49
.1.......15..........63.............249...............993................3969
.1.......59.........503............4049.............32313..............258353
.1......233........4017...........64577...........1030457............16477441
.1......929.......32123.........1032785..........32958333..........1054068853
.1.....3697......256849........16520553........1054361217.........67441480753
.1....14719.....2053803.......264274797.......33731920377.......4315258520649
.1....58599....16422459......4227506465.....1079168990473.....276111139100297
.1...233291...131315929.....67625780417....34525267140421...17666902721644133
.1...928769..1050017821...1081783483265..1104548251723921.1130412517172994361
.1..3697573..8396067527..17304872546433.35337216591063957
.1.14720617.67135955941.276819362795425
LINKS
EXAMPLE
Some solutions for n=3 k=4
..1..1..1..0....0..0..1..0....1..0..0..0....1..1..0..0....1..1..1..0
..0..1..0..0....0..0..1..1....0..0..1..1....0..1..0..0....0..1..1..1
..0..1..1..1....1..0..1..0....1..1..1..0....0..1..0..1....0..0..1..0
CROSSREFS
Column 2 is A218200
Row 1 is A218199
Row 2 is A218313
Sequence in context: A051927 A322069 A194595 * A218810 A218638 A232295
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Nov 11 2012
STATUS
approved