A173751 a(n) = gcd(n, lcm_{p is a prime divisor of n} (p-1)) = gcd(n, A173614(n)).

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 3, 4, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 5, 2, 3, 2, 1, 4, 1, 2, 3, 1, 1, 2, 1, 4, 1, 2, 1, 2, 1, 2, 1, 2, 1, 6, 1, 4, 1, 2, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 4, 1, 2, 1, 4, 3

Offset

1,6

Comments

a(n) is divisor of A126864(n).

Links

Andrew Howroyd, Table of n, a(n) for n = 1..10000

A. M. Oller-Marcen, On arithmetic numbers, arXiv preprint arXiv:1206.1823 [math.NT], 2012. From N. J. A. Sloane, Nov 25 2012

Example

84 = 2^2*3*7; lcm{p-1|p is prime and divisor of 84} = lcm{1,2,6} = 6; gcd(84,6) = 6 ==> a(84)=6.

Mathematica

fa=FactorInteger; lcm[n_] := Module[{aux = 1, lon = Length[fa[n]]}, Do[aux = LCM[aux, (fa[n][[i]][[1]] - 1)], {i, lon}]; aux] a[n_] := GCD[lcm[n], n]; Table[a[n], {n, 1, 300}]

Prog

(PARI) a(n)=gcd(n, lcm(apply(p->p-1, factor(n)[, 1]))) \\ Andrew Howroyd, Aug 06 2018

Crossrefs

Cf. A173614.

Sequence in context: A327403 A247371 A331177 * A126864 A348928 A124766

Adjacent sequences: A173748 A173749 A173750 * A173752 A173753 A173754

Keyword

nonn

Author

José María Grau Ribas, Feb 23 2010

Status

approved