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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050624 Let b(n) = A050623(n) = smallest n-digit number divisible by 3^n; sequence gives b(n)/3^n. 1
1, 2, 4, 13, 42, 138, 458, 1525, 5081, 16936, 56451, 188168, 627226, 2090752, 6969172, 23230574, 77435244, 258117480, 860391598, 2867971991, 9559906636, 31866355454, 106221184845, 354070616148, 1180235387158, 3934117957192 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = ceiling(10^(n-1)/3^n). - Vladeta Jovovic, Feb 14 2003
CROSSREFS
Cf. A050623.
Sequence in context: A243107 A002771 A284159 * A135501 A001548 A193057
KEYWORD
nonn,base
AUTHOR
Patrick De Geest, Jun 15 1999
EXTENSIONS
More terms from Erich Friedman, Feb 19 2000
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 June 20 23:53 EDT 2024. Contains 373535 sequences. (Running on oeis4.)