|
|
A229719
|
|
Number of arrays of length 3 that are sums of n consecutive elements of length 3+n-1 permutations of 0..3+n-2, and no two consecutive rises or falls in the latter permutation.
|
|
0
|
|
|
4, 6, 28, 76, 256, 374, 948, 1024, 2264, 2166, 4396, 3912
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4:
10 12 10 8 9 8 10 8 8 8 9 10 10 10 13 7
8 9 11 11 11 7 7 12 11 10 11 11 13 12 10 10
9 7 9 14 10 10 8 14 13 11 12 10 12 11 8 12
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|