%I #35 Sep 08 2024 11:48:17

%S 3,6,9,13,16,19,23,26,29,33,36,39,43,46,49,53,56,59,63,66,69,73,76,79,

%T 83,86,89,93,96,99,102,106,109,112,116,119,122,126,129,132,136,139,

%U 142,146,149,152,156,159,162,166,169,172,176,179,182,186,189,192,195,199

%N Beatty sequence for log_2(10).

%C Number of positive integers <= 10^n that are divisible by no prime exceeding 2.

%C Maximum number of prime divisors of positive integers <= 10^n counted with multiplicity. - _Martin Renner_, Apr 04 2014

%C You wish to represent the rational number n/d in decimal notation, where n is an integer, d is a nonzero integer, and precision(d) represents the number of decimal digits in d. The decimal notation representation of n/d will either terminate or repeat with a repetend. If the decimal notation representation terminates then this sequence defines the maximum number of decimal digits to the right of the decimal point (after truncating trailing zeros) for a given precision of d ... floor(precision(d) * log_2(10)). - _Michael T Howard_, Jul 17 2017

%C Beatty complement of A066344. - _Jianing Song_, Jan 27 2019

%H Harry J. Smith, <a href="/A066343/b066343.txt">Table of n, a(n) for n = 1..1000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>

%F a(n) = floor(n*log_2(10)).

%p seq(floor(log[2](10)*n),n=1..60); # _Martin Renner_, Apr 04 2014

%t Table[ Floor[ n*Log[2, 10]], {n, 60}] (* _Robert G. Wilson v_, May 27 2005 *)

%o (PARI) { l=log(10)/log(2); for (n=1, 1000, a=floor(n*l); write("b066343.txt", n, " ", a) ) } \\ _Harry J. Smith_, Feb 11 2010

%o (Python)

%o def A066343(n): return (5**n).bit_length()+n-1 # _Chai Wah Wu_, Sep 08 2024

%Y Cf. A066344, A067497, A129344.

%Y Cf. A020862 (log_2(10)).

%K easy,nonn

%O 1,1

%A _Vladeta Jovovic_, Dec 15 2001