login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050621 Smallest n-digit number divisible by 2^n. 24

%I

%S 2,12,104,1008,10016,100032,1000064,10000128,100000256,1000000512,

%T 10000001024,100000002048,1000000004096,10000000008192,

%U 100000000016384,1000000000032768,10000000000065536,100000000000131072

%N Smallest n-digit number divisible by 2^n.

%C Quotients arising from this sequence give A034478 ((5^(n-1)+1)/2).

%F 10^(n-1) + 2^(n-1).

%F G.f.: Q(0) where Q(k)= 1 + 5^k/(1 - 2*x/(2*x + 5^k/Q(k+1) )); (continued fraction ). - _Sergei N. Gladkovskii_, Apr 10 2013

%Y Cf. A035014, A034478, A050622.

%K nonn,base

%O 1,1

%A _Patrick De Geest_, Jun 15 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified August 27 06:59 EDT 2014. Contains 246117 sequences.