A327936 Multiplicative with a(p^e) = p if e >= p, otherwise 1.

1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2

Offset

1,4

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

Formula

Multiplicative with a(p^e) = p if e >= p, otherwise 1.

A001221(a(n)) = A129251(n).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} (1 + (p-1)/p^p) = 1.3443209052633459342... . - Amiram Eldar, Nov 07 2022

Example

For n = 12 = 2^2 * 3^1, only prime factor p = 2 satisfies p^p | 12, thus a(12) = 2.
For n = 108 = 2^2 * 3^3, both prime factors p = 2 and p = 3 satisfy p^p | 108, thus a(108) = 2*3 = 6.

Mathematica

Array[Apply[Times, FactorInteger[#] /. {p_, e_} /; IntegerQ@ p :> If[e >= p, p, 1]] &, 120] (* Michael De Vlieger, Oct 01 2019 *)

Prog

(PARI) A327936(n) = { my(f = factor(n)); for(k=1, #f~, f[k, 2] = (f[k, 2]>=f[k, 1])); factorback(f); };

Crossrefs

Cf. A001221, A129251, A327937, A327938, A327939.

Differs from A129252 for the first time at n=108.

Sequence in context: A081117 A368334 A129252 * A333748 A022929 A307706

Adjacent sequences: A327933 A327934 A327935 * A327937 A327938 A327939

Keyword

nonn,mult

Author

Antti Karttunen, Oct 01 2019

Status

approved