login
A203638
T(n,k)=Number of nXk 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
9
2, 4, 4, 4, 4, 4, 2, 6, 6, 2, 8, 6, 8, 6, 8, 12, 26, 52, 52, 26, 12, 6, 90, 236, 154, 236, 90, 6, 32, 222, 492, 3824, 3824, 492, 222, 32, 56, 674, 7636, 34648, 58816, 34648, 7636, 674, 56, 32, 2158, 41300, 103690, 951900, 951900, 103690, 41300, 2158, 32, 160, 6546
OFFSET
1,1
COMMENTS
Table starts
..2...4.....4.......2.........8..........12.............6..............32
..4...4.....6.......6........26..........90...........222.............674
..4...6.....8......52.......236.........492..........7636...........41300
..2...6....52.....154......3824.......34648........103690.........3172388
..8..26...236....3824.....58816......951900......16080792.......278135578
.12..90...492...34648....951900.....8752012.....835055180.....26168432516
..6.222..7636..103690..16080792...835055180...14513555724...2569455032894
.32.674.41300.3172388.278135578.26168432516.2569455032894.259726000943352
LINKS
EXAMPLE
Some solutions for n=5 k=3
..0..0..0....0..0..0....0..0..1....0..0..1....1..0..0....0..0..1....1..1..1
..0..0..0....1..0..0....0..0..0....0..0..1....1..1..0....1..0..0....0..0..1
..1..0..1....0..1..1....0..1..1....0..0..1....1..0..0....0..0..0....0..1..1
..1..1..1....0..1..1....0..1..1....1..1..1....1..0..0....1..1..1....0..0..1
..0..1..1....0..1..1....1..1..1....1..0..1....1..1..1....1..1..1....0..0..1
CROSSREFS
Sequence in context: A036264 A105192 A345438 * A040002 A151798 A334897
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Jan 04 2012
STATUS
approved