The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A332813 a(n) = A048675(n) mod 3. 6
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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 FORMULA a(n) = A010872(A048675(n)). a(A332461(n)) = a(A332462(n)) = A329903(n). PROG (PARI) A332813(n) = { my(f = factor(n)); (sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2)%3; }; 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. Sequence in context: A153241 A306863 A334108 * A323077 A334201 A257400 Adjacent sequences: A332810 A332811 A332812 * A332814 A332815 A332816 KEYWORD nonn AUTHOR Antti Karttunen, Mar 01 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 23 09:22 EDT 2024. Contains 371905 sequences. (Running on oeis4.)