login
A218897
T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 nXk array
13
2, 2, 4, 4, 6, 8, 6, 18, 16, 16, 10, 34, 72, 38, 32, 16, 86, 212, 286, 98, 64, 26, 180, 786, 1096, 1162, 244, 128, 42, 426, 2594, 6280, 6422, 4700, 614, 256, 68, 930, 9110, 28598, 54726, 35812, 19046, 1542, 512, 110, 2140, 31062, 149238, 373612, 463746, 202662
OFFSET
1,1
COMMENTS
Table starts
....2.....2........4..........6...........10.............16...............26
....4.....6.......18.........34...........86............180..............426
....8....16.......72........212..........786...........2594.............9110
...16....38......286.......1096.........6280..........28598...........149238
...32....98.....1162.......6422........54726.........373612..........2880294
...64...244.....4700......35812.......463746........4575512.........52413310
..128...614....19046.....202662......3960146.......57116962........969423130
..256..1542....77198....1143320.....33785542......710022390......17870306268
..512..3872...312944....6451714....288335090.....8831593874.....329607859688
.1024..9726..1268694...36412818...2461034914...109858747456....6079480914622
.2048.24426..5143506..205486910..21006978672..1366468080924..112133703714680
.4096.61348.20852924.1159668470.179319456042.16997248406138.2068302082008760
LINKS
EXAMPLE
Some solutions for n=3 k=4
..0..0..0..0....1..1..0..1....1..1..0..1....1..0..0..0....1..0..1..0
..1..0..1..0....1..0..0..0....1..0..0..0....0..0..0..0....0..0..0..0
..1..0..0..0....1..0..0..0....0..0..0..1....0..0..1..1....0..0..1..0
CROSSREFS
Column 2 is A217631
Row 1 is A006355(n+1)
Sequence in context: A363213 A089076 A123067 * A218064 A352227 A334001
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Nov 08 2012
STATUS
approved