A261490 The total element sum of the n-fold f transform applied to the length n sequence of 1's. And f returns a sorted result after multiplying the elements in its input sequence with 1, 2, 3,... in descending size order.

0, 1, 4, 19, 100, 633, 4626, 37878, 348224, 3542952, 39339852, 478962252, 6289532928, 89038853856, 1346224983936, 21729308136720, 371924399416320, 6740200653419520, 128878557725067264, 2598800542616444724, 54986036469506668800, 1217069235297874269792

Offset

0,3

Links

Alois P. Heinz, Table of n, a(n) for n = 0..250

Maple

f:= l-> sort([seq(sort(l, `>`)[i]*i, i=1..nops(l))]):
a:= n-> add(i, i=(f@@n)([1$n])):
seq(a(n), n=0..35);

Crossrefs

Main diagonal of A166278.

Cf. A031971 (for ascending sort), A036740 (when sum is replaced by product).

Sequence in context: A369672 A086624 A307121 * A277956 A307678 A151382

Adjacent sequences: A261487 A261488 A261489 * A261491 A261492 A261493

Keyword

nonn

Author

Alois P. Heinz, Aug 21 2015

Status

approved