[go: up one dir, main page]

login
A203595
Number of nX2 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
1
9, 16, 46, 16, 596, 936, 5326, 64452, 35472, 2267096, 6154424, 36768700, 493844572, 304850530, 19837028156, 60734482172, 379565828184, 5278506424584, 3491085331400, 230590641604648, 737735394947292, 4754537676837632
OFFSET
1,1
COMMENTS
Column 2 of A203600
LINKS
EXAMPLE
Some solutions for n=5
..1..2....0..1....2..0....2..2....2..2....2..1....1..0....1..2....0..2....2..2
..2..2....0..2....1..0....2..0....2..1....2..0....2..2....0..2....1..2....1..2
..0..2....0..2....2..0....1..0....0..0....2..0....0..2....0..2....2..2....1..2
..1..0....0..2....2..1....0..0....1..0....2..0....0..1....1..2....1..0....0..0
..0..0....1..2....2..0....1..2....2..2....1..0....0..0....0..0....0..0....0..1
CROSSREFS
Sequence in context: A282470 A067956 A270757 * A187087 A072861 A183371
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 03 2012
STATUS
approved