A374326 The square root of the maximal exponent in the prime factorization of the numbers whose maximal exponent in their prime factorization is a square.

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 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, 1, 1, 1

Offset: 1

Author

Amiram Eldar, Jul 04 2024

Keywords

• nonn
• easy

Comments

First differs from A369936 at n = 95.

The first occurrence of k = 0, 1, ... is at 1, 2, 12, 335, 42563, ..., which is the position of 2^(k^2) at A369937.

Links

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

Crossrefs

Cf. A051903, A369936, A369937.

Similar sequences: A374324, A374325, A374327, A374328.

Programs

Mathematica

f[n_] := Module[{s = Sqrt[If[n == 1, 0, Max[FactorInteger[n][[;; , 2]]]]]}, If[IntegerQ[s], s, Nothing]]; Array[f, 200]

PARI

lista(kmax) = {my(e); print1(0, ", "); for(k = 2, kmax, e = vecmax(factor(k)[, 2]); if(issquare(e), print1(sqrtint(e), ", ")));}

Formula

a(n) = sqrt(A374325(n)).

a(n) = sqrt(A051903(A369937(n))).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} k * d(k) / Sum_{k>=1} d(k) = 1.06543556163434367736..., where d(k) = 1/zeta(k^2+1) - 1/zeta(k^2) for k>=2, and d(1) = 1/zeta(2).