A332813 a(n) = A048675(n) mod 3.

0, 1, 2, 2, 1, 0, 2, 0, 1, 2, 1, 1, 2, 0, 0, 1, 1, 2, 2, 0, 1, 2, 1, 2, 2, 0, 0, 1, 2, 1, 1, 2, 0, 2, 0, 0, 2, 0, 1, 1, 1, 2, 2, 0, 2, 2, 1, 0, 1, 0, 0, 1, 2, 1, 2, 2, 1, 0, 1, 2, 2, 2, 0, 0, 0, 1, 1, 0, 0, 1, 2, 1, 1, 0, 1, 1, 0, 2, 2, 2, 2, 2, 1, 0, 2, 0, 1, 1, 2, 0, 1, 0, 0, 2, 0, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2

Offset: 1

Author

Antti Karttunen, Mar 01 2020

Keywords

• nonn

Comments

Completely additive modulo 3.

See comments in A332823 which is 0,+1,-1 version of this sequence.

Links

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

Crossrefs

Cf. A010872, A048675, A332461, A332462.

Cf. A332823 (for 0,+1,-1 version of this sequence).

Cf. A332820, A332821, A332822 for positions of 0's, 1's and 2's in this sequence.

Cf. also A329903.

Programs

PARI

A332813(n) = { my(f = factor(n)); (sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2)%3; };

Formula

a(n) = A010872(A048675(n)).

a(A332461(n)) = a(A332462(n)) = A329903(n).