A110369 (Digit 1 repeated n times) + n.

2, 13, 114, 1115, 11116, 111117, 1111118, 11111119, 111111120, 1111111121, 11111111122, 111111111123, 1111111111124, 11111111111125, 111111111111126, 1111111111111127, 11111111111111128, 111111111111111129, 1111111111111111130

Offset: 1

Author

Amarnath Murthy, Jul 24 2005

Keywords

• base
• easy
• nonn

Comments

Partial sums of A062397. - Klaus Purath, Mar 18 2021

Examples

			a(12) = 111111111111 + 12 = 111111111123.
		

Links

• Harvey P. Dale, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A002275 (repunits).

Programs

Mathematica

Table[FromDigits[PadRight[{},n,1]]+n,{n,20}] (* Harvey P. Dale, May 15 2019 *)

Sage

[gaussian_binomial(n,1,10)+n for n in range(1,20)] # Zerinvary Lajos, May 29 2009

Formula

a(n) = A002275(n) + n. - Michel Marcus, Mar 04 2018

a(n) = (10^n - 1)/9 + n. - Klaus Purath, Mar 18 2021

Extensions

More terms from Joshua Zucker, May 08 2006

An incorrect recurrence was deleted by N. J. A. Sloane, Sep 13 2009