|
%I #15 May 14 2023 20:55:43
%S 11,112,1113,11114,111115,1111116,11111117,111111118,1111111119,
%T 111111111110,1111111111111,11111111111112,111111111111113,
%U 1111111111111114,11111111111111115,111111111111111116,1111111111111111117,11111111111111111118,111111111111111111119
%N n 1's followed by n.
%D J. Earls, On Smarandache Repunit N Numbers, Smarandache Notions Journal, Journal (2004), Vol. 14.1, pp 251-258.
%F a(n) = (10^n-1)/9*10^L + n, where L is the number of decimal digits of n.
%t Array[(10^# - 1)/9*10^IntegerLength[#] + # &, 16] (* or *)
%t Array[FromDigits[ConstantArray[1, #]~Join~IntegerDigits[#]] &, 16] (* _Michael De Vlieger_, Mar 21 2018 *)
%Y Cf. A070746.
%K base,easy,nonn,less
%O 1,1
%A _Jason Earls_, Oct 15 2002
|
