A340677 a(n) = A007947(n) / gcd(A007947(n), A008472(n)).

1, 1, 1, 1, 1, 6, 1, 1, 1, 10, 1, 6, 1, 14, 15, 1, 1, 6, 1, 10, 21, 22, 1, 6, 1, 26, 1, 14, 1, 3, 1, 1, 33, 34, 35, 6, 1, 38, 39, 10, 1, 7, 1, 22, 15, 46, 1, 6, 1, 10, 51, 26, 1, 6, 55, 14, 57, 58, 1, 3, 1, 62, 21, 1, 65, 33, 1, 34, 69, 5, 1, 6, 1, 74, 15, 38, 77, 13, 1, 10, 1, 82, 1, 7, 85, 86, 87, 22, 1, 3, 91, 46, 93

Offset

1,6

Links

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

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Formula

a(n) = A007947(n) / A099636(n) = A007947(n) / gcd(A007947(n), A008472(n)).

a(n) = 1 iff n is power of prime (A000961). - Bernard Schott, Feb 01 2021

a(A006881(n)) = A006881(n). - Bernard Schott and Antti Karttunen, Feb 01 2021

Prog

(PARI)
A007947(n) = factorback(factorint(n)[, 1]);
A008472(n) = vecsum(factor(n)[, 1]);
A340677(n) = { my(u=A007947(n)); (u/gcd(u, A008472(n))); };

Crossrefs

Cf. A000961 (positions of ones), A006881, A007947, A008472, A099636, A340678.

Cf. also A082344.

Sequence in context: A072815 A348979 A080304 * A340679 A166142 A290479

Adjacent sequences: A340674 A340675 A340676 * A340678 A340679 A340680

Keyword

nonn

Author

Antti Karttunen, Feb 01 2021

Status

approved