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

%I #11 Oct 15 2019 11:54:22

%S 1,2,4,13,42,138,458,1525,5081,16936,56451,188168,627226,2090752,

%T 6969172,23230574,77435244,258117480,860391598,2867971991,9559906636,

%U 31866355454,106221184845,354070616148,1180235387158,3934117957192

%N Let b(n) = A050623(n) = smallest n-digit number divisible by 3^n; sequence gives b(n)/3^n.

%F a(n) = ceiling(10^(n-1)/3^n). - _Vladeta Jovovic_, Feb 14 2003

%Y Cf. A050623.

%K nonn,base

%O 1,2

%A _Patrick De Geest_, Jun 15 1999

%E More terms from _Erich Friedman_, Feb 19 2000

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 25 11:48 EDT 2024. Contains 373701 sequences. (Running on oeis4.)