A060554 String together the first n numbers in an order which maximizes the result.

1, 21, 321, 4321, 54321, 654321, 7654321, 87654321, 987654321, 98765432110, 9876543211110, 987654321211110, 98765432131211110, 9876543214131211110, 987654321514131211110, 98765432161514131211110

Offset

1,2

Links

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

Sean A. Irvine, Java program (github)

Prog

(Python)
from itertools import count, islice
def agen(): # generator of terms
    slst = []
    for n in count(1):
        s, greatest, argreatest = str(n), "/", None
        for i in range(len(slst)+1):
            t = "".join(slst[:i]) + s + "".join(slst[i:])
            if t > greatest: greatest, argreatest = t, i
        slst.insert(argreatest, s)
        yield int("".join(slst))
print(list(islice(agen(), 16))) # Michael S. Branicky, Nov 30 2022

Crossrefs

Cf. A000422, A060555.

Sequence in context: A138793 A014925 A000422 * A057610 A036737 A141267

Adjacent sequences: A060551 A060552 A060553 * A060555 A060556 A060557

Keyword

base,easy,nonn

Author

Henry Bottomley, Apr 02 2001

Extensions

Incorrect comment removed by Sean A. Irvine, Nov 30 2022

Status

approved