A162213 -id:A162213 - cp's OEIS frontend

A053041 Smallest n-digit number divisible by n.

1, 10, 102, 1000, 10000, 100002, 1000006, 10000000, 100000008, 1000000000, 10000000010, 100000000008, 1000000000012, 10000000000004, 100000000000005, 1000000000000000, 10000000000000016, 100000000000000008, 1000000000000000018, 10000000000000000000

Offset: 1

Henry Bottomley, Feb 24 2000

Harry J. Smith, Table of n, a(n) for n = 1..150

Cf. A066559, A066209, A066557, A066558, A162213.

A053041:=n->n*ceil(10^(n-1)/n); seq(A053041(n), n=1..30); # Wesley Ivan Hurt, Nov 28 2013

Table[Ceiling[10^(n-1)/n]n,{n,20}] (* Harvey P. Dale, Jan 17 2012 *)

a(n) = { n*ceil(10^(n-1)/n) } \\ Harry J. Smith, Feb 23 2010

a(n) = n*ceiling(10^(n-1)/n). - Vladeta Jovovic, Dec 27 2001

More terms from David Wasserman, Feb 26 2002

A162214 a(n) = the largest positive multiple of n with exactly n digits when written in binary.

Original entry on oeis.org

1, 2, 6, 12, 30, 60, 126, 248, 504, 1020, 2046, 4092, 8190, 16380, 32760, 65520, 131070, 262134, 524286, 1048560, 2097144, 4194300, 8388606, 16777200, 33554425, 67108860, 134217702, 268435440, 536870910, 1073741820, 2147483646, 4294967264, 8589934584

Offset: 1

Leroy Quet, Jun 28 2009

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Cf. A162213.

a:= n-> n*floor((2^n-1)/n): seq(a(n), n=1..40); # Alois P. Heinz, Jul 11 2009

Array[# Floor[(2^# - 1)/#] &, 31] (* Michael De Vlieger, Nov 04 2017 *)

a(n) = n * floor((2^n-1)/n). - Alois P. Heinz, Jul 11 2009

More terms from Alois P. Heinz, Jul 11 2009

cp's OEIS Frontend

A053041 Smallest n-digit number divisible by n.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions