%I #4 Nov 03 2012 13:40:45

%S 1,3,1,7,13,1,13,57,49,1,25,225,449,191,1,49,895,3565,3567,737,1,97,

%T 3565,28325,56629,28305,2849,1,191,14189,225647,898763,900213,224643,

%U 11011,1,375,56489,1798967,14313773,28543403,14309253,1782855,42557,1,737,224891

%N 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..2 nXk array

%C Table starts

%C .1.......3...........7..............13.................25

%C .1......13..........57.............225................895

%C .1......49.........449............3565..............28325

%C .1.....191........3567...........56629.............898763

%C .1.....737.......28305..........900213...........28543403

%C .1....2849......224643........14309253..........906390787

%C .1...11011.....1782855.......227451273........28782653703

%C .1...42557....14149449......3615431533.......913998678577

%C .1..164481...112295673.....57468767413.....29024205558587

%C .1..635711...891223263....913489632033....921669292406117

%C .1.2456993..7073103393..14520292432269..29267787550042425

%C .1.9496161.56134970523.230806004700461.929404283528404253

%H R. H. Hardin, <a href="/A218592/b218592.txt">Table of n, a(n) for n = 1..178</a>

%e Some solutions for n=3 k=4

%e ..0..1..1..0....0..0..1..0....0..1..0..1....0..0..0..0....1..1..1..0

%e ..1..0..0..1....1..0..0..1....1..1..1..1....1..0..0..1....0..0..0..0

%e ..1..0..1..1....0..0..0..0....0..1..1..0....0..0..0..0....1..0..0..1

%Y Column 2 is A218420

%Y Row 1 is A218199

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Nov 03 2012