The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110369 (Digit 1 repeated n times) + n. 2
 2, 13, 114, 1115, 11116, 111117, 1111118, 11111119, 111111120, 1111111121, 11111111122, 111111111123, 1111111111124, 11111111111125, 111111111111126, 1111111111111127, 11111111111111128, 111111111111111129, 1111111111111111130 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 FORMULA a(n) = A002275(n) + n. - Michel Marcus, Mar 04 2018 EXAMPLE a(12) = 111111111111 + 12 = 111111111123. MATHEMATICA Table[FromDigits[PadRight[{}, n, 1]]+n, {n, 20}] (* Harvey P. Dale, May 15 2019 *) PROG (Sage) [gaussian_binomial(n, 1, 10)+n for n in range(1, 20)] # Zerinvary Lajos, May 29 2009 CROSSREFS Cf. A002275 (repunits). Sequence in context: A247153 A088604 A127891 * A212071 A258620 A209174 Adjacent sequences:  A110366 A110367 A110368 * A110370 A110371 A110372 KEYWORD base,easy,nonn AUTHOR Amarnath Murthy, Jul 24 2005 EXTENSIONS More terms from Joshua Zucker, May 08 2006 An incorrect recurrence was deleted by N. J. A. Sloane, Sep 13 2009 STATUS approved

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

Last modified January 19 15:57 EST 2021. Contains 340270 sequences. (Running on oeis4.)