This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275576 #15 Nov 02 2018 22:52:24
%S A275576 1,5,45,524,7450,125992,2472197,55163096,1379215566,38203654070,
%T A275576 1161476316583,38452206880034,1376997068182450,53036098532973584,
%U A275576 2186272797635061105,96043562430904351024,4479387734051244791950,221051522602427094486042
%N A275576 Sums of lengths of longest (strictly) increasing subsequences of all n^n length-n lists of integers from {1,2,...,n}.
%F A275576 a(n) = Sum_{k=1..n} k * A245667(n,k). - _Alois P. Heinz_, Nov 02 2018
%e A275576 For n = 2 there are 4 such sequences: (1,1), (1,2), (2,1), and (2,2).
%e A275576 The corresponding lengths of longest (strictly) increasing subsequences of these is 1, 2, 1, 1, so a(2) = 5.
%Y A275576 Cf. A003316, which computes the same thing for permutations.
%Y A275576 Cf. A275577, which computes the same thing for not necessarily strictly increasing subsequences.
%Y A275576 Cf. A245667.
%K A275576 nonn,more
%O A275576 1,2
%A A275576 _Jeffrey Shallit_, Aug 02 2016
%E A275576 a(8)-a(18) from _Alois P. Heinz_, Nov 02 2018