|
|
A265118
|
|
Number of 3Xn arrays containing n copies of 0..3-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.
|
|
2
|
|
|
0, 0, 8, 6, 10, 26, 42, 70, 150, 282, 506, 1002, 1950, 3670, 7126, 13926, 26826, 52082, 101802, 198146, 386238, 755790, 1478302, 2892442, 5670210, 11122230, 21823494, 42863862, 84247842, 165655146, 325927242, 641635110, 1263690038, 2489962938
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 2*(r^2-r+1)/sqrt((r-1)*(2*r-1)*(2*r^2+r+1))+2*(r^3-r^2-1) -Stefan Hollos, Mar 23 2017
|
|
EXAMPLE
|
Some solutions for n=9
..0..1..0..2..1..2..1..0..2....2..1..0..1..2..1..0..2..0
..2..2..1..0..0..0..2..1..1....0..2..2..0..0..2..1..1..1
..1..0..2..1..2..1..0..2..0....1..0..1..2..1..0..2..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|