The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A261490 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

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.
(history; published version)

#13 by Alois P. Heinz at Tue Aug 25 13:52:40 EDT 2015

STATUS

editing

approved

#12 by Alois P. Heinz at Tue Aug 25 13:52:18 EDT 2015

NAME

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

CROSSREFS

Main diagonal of A166278.

Cf. A166278, A031971 (for `<` ascending sort), A036740 (when add sum is replaced by mulproduct).

STATUS

approved

editing

#11 by Alois P. Heinz at Fri Aug 21 10:04:17 EDT 2015

STATUS

editing

approved

#10 by Alois P. Heinz at Fri Aug 21 10:03:58 EDT 2015

CROSSREFS

Cf. A166278, A031971 (for `<` sort), A036740 (when add is replaced by mul).

#9 by Alois P. Heinz at Fri Aug 21 10:01:09 EDT 2015

CROSSREFS

Cf. A166278, A031971 (for `<` sort), A036740.

#8 by Alois P. Heinz at Fri Aug 21 09:58:45 EDT 2015

CROSSREFS

Cf. A166278, A031971 (for `<` sort).

#7 by Alois P. Heinz at Fri Aug 21 09:55:34 EDT 2015

CROSSREFS

Cf. A166278, A031971.

STATUS

approved

editing

#6 by Alois P. Heinz at Fri Aug 21 05:52:51 EDT 2015

STATUS

editing

approved

#5 by Alois P. Heinz at Fri Aug 21 05:52:35 EDT 2015

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);

#4 by Alois P. Heinz at Fri Aug 21 05:49:25 EDT 2015

LINKS

Alois P. Heinz, <a href="/A261490/b261490.txt">Table of n, a(n) for n = 0..250</a>