A372467 a(n) = log_2(A372466(n) + 1).

0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2

Offset

1,7

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Formula

a(n) = log_2(A051903(A036537(n)) + 1).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = (d(1) + Sum_{k>=2} (k * (d(k) - d(k-1))) / A327839 = 1.12132865776925625956..., where d(k) = Product_{p prime} (1 - 1/p + Sum_{i=1..k} (1/p^(2^i-1)-1/p^(2^i))).

Mathematica

pow2Q[n_] := n == 2^IntegerExponent[n, 2]; f[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, If[AllTrue[e, pow2Q[# + 1] &], IntegerExponent[Max @@ e + 1, 2], Nothing]]; f[1] = 0; Array[f, 150]

Prog

(PARI) ispow2(n) = n >> valuation(n, 2) == 1;
lista(kmax) = {my(e); print1(0, ", "); for(k = 2, kmax, e = factor(k)[, 2]; if(ispow2(vecprod(apply(x -> x + 1, e))), print1(valuation(vecmax(e) + 1, 2), ", "))); }

Crossrefs

Cf. A036537, A051903, A327839, A369934, A372466.

Sequence in context: A280940 A131789 A108465 * A367419 A069347 A161606

Adjacent sequences: A372464 A372465 A372466 * A372468 A372469 A372470

Keyword

nonn,easy

Author

Amiram Eldar, May 02 2024

Status

approved