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!)
A110369 (Digit 1 repeated n times) + n. 2

%I #23 Mar 18 2021 23:46:22

%S 2,13,114,1115,11116,111117,1111118,11111119,111111120,1111111121,

%T 11111111122,111111111123,1111111111124,11111111111125,

%U 111111111111126,1111111111111127,11111111111111128,111111111111111129,1111111111111111130

%N (Digit 1 repeated n times) + n.

%C Partial sums of A062397. - _Klaus Purath_, Mar 18 2021

%H Harvey P. Dale, <a href="/A110369/b110369.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A002275(n) + n. - _Michel Marcus_, Mar 04 2018

%F a(n) = (10^n - 1)/9 + n. - _Klaus Purath_, Mar 18 2021a(n) =

%e a(12) = 111111111111 + 12 = 111111111123.

%t Table[FromDigits[PadRight[{},n,1]]+n,{n,20}] (* _Harvey P. Dale_, May 15 2019 *)

%o (Sage) [gaussian_binomial(n,1,10)+n for n in range(1,20)] # _Zerinvary Lajos_, May 29 2009

%Y Cf. A002275 (repunits).

%K base,easy,nonn

%O 1,1

%A _Amarnath Murthy_, Jul 24 2005

%E More terms from _Joshua Zucker_, May 08 2006

%E An incorrect recurrence was deleted by _N. J. A. Sloane_, Sep 13 2009

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 April 24 04:02 EDT 2024. Contains 371918 sequences. (Running on oeis4.)