|
|
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
|
|
|
1, 7, 63, 716, 10050, 167707, 3246985, 71601112, 1772086842, 48644809445, 1466863148619, 48202848917302, 1714563272612502
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
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.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|