The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080479 Smallest number formed by using all the digits (with multiplicity) of next n numbers. 6

%I

%S 1,23,456,10789,1111112345,101111226789,22222222345678,

%T 1022333333334569,102333344444445789,10234444455555556789,

%U 1023455555666666666789,102345666677777777777889,10012345677888888888889999,1000000011111122334455678999999999

%N Smallest number formed by using all the digits (with multiplicity) of next n numbers.

%o (Python)

%o def a(n):

%o s = "".join(sorted("".join(map(str, range((n-1)*n//2+1, n*(n+1)//2+1)))))

%o if '0' not in s: return int(s)

%o rz = s.rfind('0')

%o return int(s[rz+1] + s[:rz+1] + s[rz+2:])

%o print([a(n) for n in range(1, 15)]) # _Michael S. Branicky_, Jan 23 2021

%Y Cf. A053067 (next n concatenated), A080480 (largest).

%K base,easy,nonn

%O 1,2

%A _Amarnath Murthy_, Mar 11 2003

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 02:16 EST 2022. Contains 358544 sequences. (Running on oeis4.)