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!)
A369934 a(n) = log_2(A369933(n)). 5
0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,14
LINKS
FORMULA
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=2..m} a(k) = (1/zeta(2) + Sum_{k>=1} (k * (d(k) - d(k-1))) / A271727 = 0.35202853155774942465..., where d(k) = Product_{p prime} (1 - 1/p^3 + Sum_{i=2..k} (1/p^(2^i)-1/p^(2^i+1))) for k >= 1, and d(0) = 1/zeta(2).
MATHEMATICA
pow2Q[n_] := n == 2^IntegerExponent[n, 2]; f[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, If[AllTrue[e, pow2Q], Log2[Max @@ e], Nothing]]; Array[f, 150, 2]
PROG
(PARI) ispow2(n) = n >> valuation(n, 2) == 1;
lista(kmax) = {my(e); for(k = 2, kmax, e = factor(k)[, 2]; if(ispow2(vecprod(e)), print1(logint(vecmax(e), 2), ", "))); }
CROSSREFS
Sequence in context: A372332 A129182 A116857 * A374328 A372505 A322338
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Feb 06 2024
STATUS
approved

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 August 17 11:18 EDT 2024. Contains 375209 sequences. (Running on oeis4.)