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!)
A069352 Total number of prime factors of 3-smooth numbers. 14

%I #21 Apr 09 2018 02:49:25

%S 0,1,1,2,2,3,2,3,4,3,4,3,5,4,5,4,6,5,4,6,5,7,6,5,7,6,5,8,7,6,8,7,6,9,

%T 8,7,6,9,8,7,10,9,8,7,10,9,8,11,7,10,9,8,11,10,9,12,8,11,10,9,12,8,11,

%U 10,13,9,12,11,10,13,9,12,11,14,10,13,9,12,11,14,10,13,12,15,11

%N Total number of prime factors of 3-smooth numbers.

%C a(n) = A001222(A003586(n));

%C a(n) = A022328(n) + A022329(n);

%C A086414(n) <= A086415(n) <= a(n).

%H Zak Seidov, <a href="/A069352/b069352.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = i+j for 3-smooth numbers n = 2^i*3^j (A003586).

%F a(n) = A001222(A033845(n))-2. - _Enrique Pérez Herrero_, Jan 04 2012

%t smoothNumbers[p_, max_] := Module[{a, aa, k, pp, iter}, k = PrimePi[p]; aa = Array[a, k]; pp = Prime[Range[k]]; iter = Table[{a[j], 0, PowerExpand @ Log[pp[[j]], max/Times @@ (Take[pp, j-1]^Take[aa, j-1])]}, {j, 1, k}]; Table[Times @@ (pp^aa), Sequence @@ iter // Evaluate] // Flatten // Sort]; PrimeOmega /@ smoothNumbers[3, 10^5] (* _Jean-François Alcover_, Nov 11 2016 *)

%o (Haskell)

%o a069352 = a001222 . a003586 -- _Reinhard Zumkeller_, May 16 2015

%Y Cf. A003586, A001222, A003586, A022328, A022329, A086414, A086415.

%K nonn

%O 1,4

%A _Reinhard Zumkeller_, Mar 18 2002

%E Edited by _N. J. A. Sloane_, Oct 27 2008 at the suggestion of _R. J. Mathar_.

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 April 23 13:11 EDT 2024. Contains 371913 sequences. (Running on oeis4.)