A070966 Sum{k|n, k<=sqrt(n)} phi(k); where the sum is over the positive divisors, k, of n, which are <= the squareroot of n; and phi(k) is the Euler totient function.

1, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 4, 1, 2, 3, 4, 1, 4, 1, 4, 3, 2, 1, 6, 5, 2, 3, 4, 1, 8, 1, 4, 3, 2, 5, 8, 1, 2, 3, 8, 1, 6, 1, 4, 7, 2, 1, 8, 7, 6, 3, 4, 1, 6, 5, 10, 3, 2, 1, 12, 1, 2, 9, 8, 5, 6, 1, 4, 3, 12, 1, 12, 1, 2, 7, 4, 7, 6, 1, 12, 9, 2, 1, 14, 5, 2, 3, 8, 1, 16, 7, 4, 3, 2, 5, 12, 1, 8, 9, 12