A290080 a(1) = 0; for n > 1, a(n) = sigma(bigomega(n)).

0, 1, 1, 3, 1, 3, 1, 4, 3, 3, 1, 4, 1, 3, 3, 7, 1, 4, 1, 4, 3, 3, 1, 7, 3, 3, 4, 4, 1, 4, 1, 6, 3, 3, 3, 7, 1, 3, 3, 7, 1, 4, 1, 4, 4, 3, 1, 6, 3, 4, 3, 4, 1, 7, 3, 7, 3, 3, 1, 7, 1, 3, 4, 12, 3, 4, 1, 4, 3, 4, 1, 6, 1, 3, 4, 4, 3, 4, 1, 6, 7, 3, 1, 7, 3, 3, 3, 7, 1, 7, 3, 4, 3, 3, 3, 12, 1, 4, 4, 7, 1, 4, 1, 7, 4

Offset: 1

Author

Antti Karttunen, Jul 23 2017

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000
• Index entries for sequences computed from exponents in factorization of n

Crossrefs

Cf. A000203, A001222, A193511, A193512.

Differs from A289617 for the first time at n=32, where a(n) = 6, while A289617(32) = 8.

Programs

Scheme

(define (A290080 n) (if (= 1 n) 0 (A000203 (A001222 n))))

Formula

a(1) = 0; for n > 1, a(n) = A000203(A001222(n)).

a(n) = A193511(n) + A193512(n).