login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050623 Smallest n-digit number divisible by 3^n. 2
3, 18, 108, 1053, 10206, 100602, 1001646, 10005525, 100009323, 1000053864, 10000125297, 100000190088, 1000000837998, 10000002002688, 100000000895004, 1000000037647854, 10000000032104772, 100000000321047720 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..18.

FORMULA

a(n) = 3^n*ceiling(10^(n-1)/3^n). - Vladeta Jovovic, Feb 14 2003

CROSSREFS

Cf. A050621, A050624.

Sequence in context: A081341 A355353 A132900 * A037760 A037648 A036724

Adjacent sequences: A050620 A050621 A050622 * A050624 A050625 A050626

KEYWORD

nonn,base,easy

AUTHOR

Patrick De Geest, Jun 15 1999

STATUS

approved

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 December 8 08:16 EST 2022. Contains 358691 sequences. (Running on oeis4.)