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”).

A203252
T(n,k)=Number of nXk 0..3 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
4
4, 16, 16, 48, 88, 48, 116, 12, 12, 116, 220, 776, 680, 776, 220, 288, 760, 18440, 18440, 760, 288, 232, 16104, 62512, 753168, 62512, 16104, 232, 96, 120260, 1282126, 50071584, 50071584, 1282126, 120260, 96, 1520, 287100, 178938580
OFFSET
1,1
COMMENTS
Table starts
...4.....16......48......116......220.....288.......232.....96.1520
..16.....88......12......776......760...16104....120260.287100
..48.....12.....680....18440....62512.1282126.178938580
.116....776...18440...753168.50071584
.220....760...62512.50071584
.288..16104.1282126
.232.120260
..96
EXAMPLE
Some solutions for n=3 k=3
..3..2..3....0..1..0....3..0..0....3..2..3....3..3..3....0..3..3....0..3..2
..0..0..3....3..2..0....3..0..2....1..1..3....2..1..1....2..3..1....0..3..2
..0..1..1....3..2..2....3..1..3....1..0..0....0..0..0....0..0..0....1..1..0
CROSSREFS
Sequence in context: A223406 A366683 A075382 * A224064 A224050 A224281
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Dec 30 2011
STATUS
approved