A275577 Sums of lengths of longest (not necessarily strictly) increasing subsequences of all n^n length-n lists of integers from {1,2,...,n}.

1, 7, 63, 716, 10050, 167707, 3246985, 71601112, 1772086842, 48644809445, 1466863148619, 48202848917302, 1714563272612502

Offset

1,2

Links

Table of n, a(n) for n=1..13.

Example

For n = 2 there are 4 such sequences:  (1,1), (1,2), (2,1), and (2,2).
The corresponding lengths of longest (not necessarily strictly) increasing subsequences of these is 2, 2, 1, 2, so a(2) =7.

Crossrefs

Cf. A003316, which computes the same thing for permutations.

Cf. A275576, which computes the same thing for strictly increasing subsequences.

Sequence in context: A051579 A185106 A375175 * A049464 A229078 A346683

Adjacent sequences: A275574 A275575 A275576 * A275578 A275579 A275580

Keyword

nonn,more

Author

Jeffrey Shallit, Aug 02 2016

Extensions

a(8)-a(13) from Alois P. Heinz, Nov 02 2018

Status

approved