cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A053041 Smallest n-digit number divisible by n.

This page as a plain text file.
%I A053041 #30 Dec 08 2024 12:25:59
%S A053041 1,10,102,1000,10000,100002,1000006,10000000,100000008,1000000000,
%T A053041 10000000010,100000000008,1000000000012,10000000000004,
%U A053041 100000000000005,1000000000000000,10000000000000016,100000000000000008,1000000000000000018,10000000000000000000
%N A053041 Smallest n-digit number divisible by n.
%H A053041 Harry J. Smith, <a href="/A053041/b053041.txt">Table of n, a(n) for n = 1..150</a>
%F A053041 a(n) = n*ceiling(10^(n-1)/n). - _Vladeta Jovovic_, Dec 27 2001
%p A053041 A053041:=n->n*ceil(10^(n-1)/n); seq(A053041(n), n=1..30); # _Wesley Ivan Hurt_, Nov 28 2013
%t A053041 Table[Ceiling[10^(n-1)/n]n,{n,20}] (* _Harvey P. Dale_, Jan 17 2012 *)
%o A053041 (PARI) a(n) = { n*ceil(10^(n-1)/n) } \\ _Harry J. Smith_, Feb 23 2010
%Y A053041 Cf. A066559, A066209, A066557, A066558, A162213.
%K A053041 base,easy,nonn,nice
%O A053041 1,2
%A A053041 _Henry Bottomley_, Feb 24 2000
%E A053041 More terms from _David Wasserman_, Feb 26 2002