cp's OEIS Frontend

A071521 Number of 3-smooth numbers <= n.

%I A071521 #81 Sep 16 2024 03:13:04
%S A071521 1,2,3,4,4,5,5,6,7,7,7,8,8,8,8,9,9,10,10,10,10,10,10,11,11,11,12,12,
%T A071521 12,12,12,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14,15,15,15,15,
%U A071521 15,15,16,16,16,16,16,16,16,16,16,16,17,17,17,17,17,17,17,17,18,18,18,18
%N A071521 Number of 3-smooth numbers <= n.
%C A071521 A 3-smooth number is a number of the form 2^x * 3^y where x >= 0 and y >= 0.
%D A071521 Bruce C. Berndt and Robert A. Rankin, "Ramanujan : letters and commentary", History of Mathematics Volume 9, AMS-LMS, p. 23, p. 35.
%D A071521 G. H. Hardy, Ramanujan: Twelve lectures on subjects suggested by his life and work, AMS Chelsea Pub., 1999, pages 67-82.
%H A071521 Reinhard Zumkeller, <a href="/A071521/b071521.txt">Table of n, a(n) for n = 1..10000</a>
%H A071521 Thierry Bousch, <a href="https://www.emis.de/journals/SLC/wpapers/s77bousch.html">La Tour de Stockmeyer</a>, Séminaire Lotharingien de Combinatoire 77 (2017), Article B77d.
%H A071521 M. Haussman and H. N. Shapiro, <a href="http://dx.doi.org/10.1002/cpa.3160420608">On Ramanujan right triangle conjecture</a>, Comm. Pure Appl. Math. 42 (1989), 885-889.
%H A071521 A. M. Ostrowski, <a href="http://dx.doi.org/10.1007/BF02940581">Bemerkungen zur Theorie der Diophantischen Approximationen</a>, Abh. Math. Sem. Univ. Hamburg 1 (1922), 77-98; 250-251.
%H A071521 Raphael Schumacher, <a href="https://arxiv.org/abs/1608.06928">The Formulas for the Distribution of the 3-Smooth, 5-Smooth, 7-Smooth and all other Smooth Numbers</a>, arXiv preprint arXiv:1608.06928 [math.NT], 2016.
%F A071521 a(n) = Card{ k | A003586(k) <= n }. Asymptotically: let a=1/(2*log(2)*log(3)), b=sqrt(6), then from Ramanujan a(n) ~ a*log(2*n)*log(3*n) or equivalently a(n) ~ a*log(b*n)^2.
%F A071521 A022331(n) = a(A000079(n)); A022330(n) = a(A000244(n)). - _Reinhard Zumkeller_, May 09 2006
%F A071521 a(n) = Sum_{k=1..n} mu(6k)*floor(n/k). - _Benoit Cloitre_, Jun 14 2007
%F A071521 a(n) = Sum_{k=1..n} (floor(6^k/k)-floor((6^k-1)/k)). - _Anthony Browne_, May 19 2016
%F A071521 From _Ridouane Oudra_, Jul 17 2020: (Start)
%F A071521 a(n) = Sum_{i=0..floor(log_2(n))} (floor(log_3(n/2^i)) + 1).
%F A071521 a(n) = Sum_{i=0..floor(log_3(n))} (floor(log_2(n/3^i)) + 1). (End)
%F A071521 A322026(n) = a(A065331(n)). - _Antti Karttunen_, Sep 08 2024
%p A071521 N:= 10000: # to get a(1) to a(N)
%p A071521 V:= Vector(N):
%p A071521 for y from 0 to floor(log[3](N)) do
%p A071521   for x from 0 to ilog2(N/3^y) do
%p A071521     V[2^x*3^y]:= 1
%p A071521 od od:
%p A071521 convert(map(round,Statistics:-CumulativeSum(V)),list); # _Robert Israel_, Dec 16 2014
%t A071521 a[n_] := Sum[ MoebiusMu[6k]*Floor[n/k], {k, 1, n}]; Table[a[n], {n, 1, 75}] (* _Jean-François Alcover_, Oct 11 2011, after _Benoit Cloitre_ *)
%t A071521 f[n_] := Sum[Floor@Log[3, n/2^i] + 1, {i, 0, Log[2, n]}]; Array[f, 75] (* faster, or *)
%t A071521 f[n_] := Sum[Floor@Log[2, n/3^i] + 1, {i, 0, Log[3, n]}]; Array[f, 75] (* _Robert G. Wilson v_, Aug 18 2012 *)
%t A071521 Accumulate[Table[If[Max[FactorInteger[n][[All,1]]]<4,1,0],{n,80}]] (* _Harvey P. Dale_, Jan 11 2017 *)
%o A071521 (PARI) for(n=1,100,print1(sum(k=1,n,if(sum(i=3,n,if(k%prime(i),0,1)),0,1)),","))
%o A071521 (PARI) a(n)=sum(k=1,n,moebius(2*3*k)*floor(n/k)) \\ _Benoit Cloitre_, Jun 14 2007
%o A071521 (PARI) a(n)=my(t=1/3); sum(k=0,logint(n,3), t*=3; logint(n\t,2)+1) \\ _Charles R Greathouse IV_, Jan 08 2018
%o A071521 (Haskell)
%o A071521 a071521 n = length $ takeWhile (<= n) a003586_list
%o A071521 -- _Reinhard Zumkeller_, Aug 14 2011
%o A071521 (Python)
%o A071521 from sympy import integer_log
%o A071521 def A071521(n): return sum((n//3**i).bit_length() for i in range(integer_log(n,3)[0]+1)) # _Chai Wah Wu_, Sep 15 2024
%Y A071521 Cf. A003586.
%Y A071521 Cf. A000079, A000244, A022330, A022331, A065331, A322026.
%K A071521 easy,nice,nonn
%O A071521 1,2
%A A071521 _Benoit Cloitre_, Jun 02 2002