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

Author

Henry Bottomley, Apr 02 2001

Keywords

• base
• easy
• nonn

Links

• Sean A. Irvine, Java program (github)

Crossrefs

Cf. A000422, A060555.

Programs

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

Extensions

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