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”).
%I #10 May 15 2023 15:41:29
%S 4,6,28,76,256,374,948,1024,2264,2166,4396,3912
%N 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.
%C Row 3 of A229717.
%e Some solutions for n=4:
%e 10 12 10 8 9 8 10 8 8 8 9 10 10 10 13 7
%e 8 9 11 11 11 7 7 12 11 10 11 11 13 12 10 10
%e 9 7 9 14 10 10 8 14 13 11 12 10 12 11 8 12
%Y Cf. A229717.
%K nonn,more
%O 1,1
%A _R. H. Hardin_, Sep 27 2013