|
|
A229560
|
|
Number of arrays of length n that are sums of 2 consecutive elements of length n+1 permutations of 0..n.
|
|
0
|
|
|
1, 6, 16, 120, 648, 5040, 38592, 362880, 3600000, 39916800, 476928000, 6227020800, 87127488000, 1307674368000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
All solutions for n=3:
1 3 5 3 4 4 5 4 1 3 5 2 2 3 2 1
4 5 2 2 1 3 4 5 3 1 3 1 3 4 5 2
5 3 1 3 2 2 1 2 5 3 1 4 4 3 4 5
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|