|
%I #4 Nov 06 2012 17:43:18
%S 1,3,1,7,15,1,15,61,57,1,29,249,481,225,1,57,993,3969,3843,895,1,113,
%T 3969,31741,63499,30719,3551,1,225,15871,253877,1015637,1015887,
%U 245509,14089,1,449,63467,2030789,16247233,32496361,16252713,1962145,55905,1
%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..3 nXk array
%C Table starts
%C .1........3...........7..............15..................29
%C .1.......15..........61.............249.................993
%C .1.......57.........481............3969...............31741
%C .1......225........3843...........63499.............1015637
%C .1......895.......30719.........1015887............32496361
%C .1.....3551......245509........16252713..........1039771513
%C .1....14089.....1962145.......260019585.........33269071149
%C .1....55905....15681787......4159932363.......1064494567893
%C .1...221827...125331399.....66552822351......34060123730017
%C .1...880191..1001668973...1064747639097....1089805494659041
%C .1..3492529..8005501761..17034402072321...34869985369949693
%C .1.13858081.63981275411.272525472991467.1115718250329709413
%H R. H. Hardin, <a href="/A218810/b218810.txt">Table of n, a(n) for n = 1..159</a>
%e Some solutions for n=3 k=4
%e ..0..1..1..1....1..0..1..1....1..0..1..0....1..0..0..1....1..0..0..0
%e ..1..0..0..0....1..1..0..0....0..0..0..0....0..0..1..0....1..1..1..1
%e ..0..1..1..0....0..0..0..1....0..1..0..0....0..0..1..1....0..1..0..1
%Y Row 1 is A218189
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Nov 06 2012
| 