A099544 Odd part of n modulo 3.

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

Offset

1,5

Comments

0 if multiple of 3, 1 if of the form 2^j*(3*k+1) with 3*k+1 odd, 2 otherwise.

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Formula

a(n) = A010872(A000265(n)).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 1. - Amiram Eldar, Aug 29 2024

Mathematica

a[n_] := Mod[n / 2^IntegerExponent[n, 2], 3]; Array[a, 100] (* Amiram Eldar, Aug 29 2024 *)

Prog

(PARI) a(n) = (n>>valuation(n, 2))%3 \\ Charles R Greathouse IV, May 14 2014

Crossrefs

Cf. A000265, A010872.

Cf. A099545, A099546, A099547, A099548, A099549, A099550, A099551.

Sequence in context: A036431 A029407 A259285 * A036414 A234954 A321201

Adjacent sequences: A099541 A099542 A099543 * A099545 A099546 A099547

Keyword

nonn,easy

Author

Ralf Stephan, Oct 23 2004

Status

approved