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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076068 Smallest number that can be formed by using the nonzero digits of the numbers 1+n(n-1)/2 through n(n+1)/2. 4

%I #16 Jan 23 2021 10:02:37

%S 1,23,456,1789,1111112345,11111226789,22222222345678,122333333334569,

%T 12333344444445789,1234444455555556789,123455555666666666789,

%U 12345666677777777777889,112345677888888888889999,111111122334455678999999999,111111111111111111111111112234566778899

%N Smallest number that can be formed by using the nonzero digits of the numbers 1+n(n-1)/2 through n(n+1)/2.

%C Is there any r and s such that a(r) = a(s)? Probably not.

%e a(4) = 1789 (=01789) formed by using digits of 7,8,9 and 10.

%t sncbf[n_]:=Sort[Flatten[IntegerDigits/@Range[(n(n-1))/2+1,(n(n+1))/2]]/.(0->Nothing)]//FromDigits; Array[sncbf,15] (* _Harvey P. Dale_, Nov 26 2019 *)

%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 return int(s[s.rfind('0')+1:])

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

%Y Cf. A053067 (next n concatenated), A080479 (smallest with zeros), A080480 (largest with zeros).

%K base,easy,nonn

%O 1,2

%A _Amarnath Murthy_, Oct 05 2002

%E More terms from _David Wasserman_, Mar 19 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:59 EDT 2024. Contains 371277 sequences. (Running on oeis4.)