A229566 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A229566

Number of arrays of length 3 that are sums of n consecutive elements of length 3+n-1 permutations of 0..3+n-2.

%I #7 Apr 27 2021 21:10:11

%S 6,16,96,264,524,920,1484,2216,3148,4304,5708,7384

%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.

%C Row 3 of A229565.

%e Some solutions for n=3:

%e 6 6 5 5 3 5 3 4 9 4 6 6 7 7 6 9

%e 3 8 6 6 7 7 6 7 8 6 7 7 9 3 3 7

%e 6 5 8 7 9 5 9 9 4 7 5 4 7 4 4 5

%Y Cf. A229565.

%K nonn

%O 1,1

%A _R. H. Hardin_, Sep 26 2013