|
%I #32 Sep 24 2020 04:09:33
%S 1,3,4,9,12,16,27,36,48,64,81,108,144,192,243,256,324,432,576,729,768,
%T 972,1024,1296,1728,2187,2304,2916,3072,3888,4096,5184,6561,6912,8748,
%U 9216,11664,12288,15552,16384,19683,20736,26244,27648,34992,36864,46656
%N Numbers of form 3^i*4^j, with i, j >= 0.
%C Subsequence of 3-smooth numbers, cf. A003586.
%H Reinhard Zumkeller, <a href="/A025613/b025613.txt">Table of n, a(n) for n = 1..10000</a>
%H F. Javier de Vega, <a href="https://arxiv.org/abs/2003.13378">An extension of Furstenberg's theorem of the infinitude of primes</a>, arXiv:2003.13378 [math.NT], 2020.
%F Sum_{n>=1} 1/a(n) = (3*4)/((3-1)*(4-1)) = 2. - _Amiram Eldar_, Sep 24 2020
%F a(n) ~ exp(sqrt(2*log(3)*log(4)*n)) / sqrt(12). - _Vaclav Kotesovec_, Sep 24 2020
%t n = 10^5; Flatten[Table[3^i*4^j, {i, 0, Log[3, n]}, {j, 0, Log[4, n/3^i]}]] // Sort (* _Amiram Eldar_, Sep 24 2020 *)
%o (Haskell)
%o import Data.Set (singleton, deleteFindMin, insert)
%o a025613 n = a025613_list !! (n-1)
%o a025613_list = f $ singleton 1
%o where f s = m : (f $ insert (3*m) $ insert (4*m) s')
%o where (m, s') = deleteFindMin s
%o -- _Reinhard Zumkeller_, Jun 01 2011
%o (PARI) list(lim)=my(v=List(), N); for(n=0, logint(lim\1,3), N=3^n; while(N<=lim, listput(v, N); N<<=2)); Set(v) \\ _Charles R Greathouse IV_, Sep 10 2015
%Y Subsequence of A003586.
%K easy,nonn
%O 1,2
%A _David W. Wilson_
|
