login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329903 a(n) = A156552(n) mod 3. 10
0, 1, 2, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 2, 1, 0, 1, 1, 2, 1, 0, 0, 1, 2, 0, 2, 2, 2, 2, 0, 1, 1, 1, 0, 2, 0, 2, 2, 0, 0, 1, 1, 2, 1, 1, 0, 1, 2, 0, 1, 1, 2, 2, 2, 0, 2, 0, 2, 1, 1, 2, 0, 2, 0, 2, 0, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 0, 0, 1, 0, 0, 2, 0, 0, 2, 0, 0, 1, 1, 0, 2, 2, 1, 1, 1, 0, 2, 0, 1, 2, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

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(A156552(n)) = A156552(n) mod 3.

MATHEMATICA

Array[Mod[#, 3] &@ Floor@ Total@ Flatten@ MapIndexed[#1 2^(#2 - 1) &, Flatten[Table[2^(PrimePi@ #1 - 1), {#2}] & @@@ FactorInteger@ #]] &, 105] (* Michael De Vlieger, Dec 27 2019 *)

PROG

(PARI)

A156552(n) = {my(f = factor(n), p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552

A329903(n) = (A156552(n)%3);

CROSSREFS

Cf. A010872, A156552.

Cf. A329609 (gives positions of zeros).

Sequence in context: A306327 A176239 A292475 * A316716 A145462 A159934

Adjacent sequences:  A329900 A329901 A329902 * A329904 A329905 A329906

KEYWORD

nonn

AUTHOR

Antti Karttunen, Dec 08 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 04:10 EDT 2021. Contains 345354 sequences. (Running on oeis4.)