A345266 - OEIS

A345266

a(n) = Sum_{p|n, p prime} gcd(p,n/p).

0, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 4, 1, 3, 2, 2, 1, 3, 5, 2, 3, 3, 1, 3, 1, 2, 2, 2, 2, 5, 1, 2, 2, 3, 1, 3, 1, 3, 4, 2, 1, 3, 7, 6, 2, 3, 1, 4, 2, 3, 2, 2, 1, 4, 1, 2, 4, 2, 2, 3, 1, 3, 2, 3, 1, 5, 1, 2, 6, 3, 2, 3, 1, 3, 3, 2, 1, 4, 2, 2, 2, 3, 1, 5, 2, 3, 2, 2, 2, 3, 1, 8, 4, 7, 1, 3, 1, 3, 3

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

LINKS

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

Index entries for sequences related to gcd's.

FORMULA

a(p) = 1 for p prime.

From Wesley Ivan Hurt, Nov 21 2021: (Start)

a(n) = A056169(n) + A063958(n).

If n is squarefree, then a(n) = omega(n).

a(p^k) = p for primes p and k >= 2. (End)