login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A099549
Odd part of n modulo 8.
8
1, 1, 3, 1, 5, 3, 7, 1, 1, 5, 3, 3, 5, 7, 7, 1, 1, 1, 3, 5, 5, 3, 7, 3, 1, 5, 3, 7, 5, 7, 7, 1, 1, 1, 3, 1, 5, 3, 7, 5, 1, 5, 3, 3, 5, 7, 7, 3, 1, 1, 3, 5, 5, 3, 7, 7, 1, 5, 3, 7, 5, 7, 7, 1, 1, 1, 3, 1, 5, 3, 7, 1, 1, 5, 3, 3, 5, 7, 7, 5, 1, 1, 3, 5, 5, 3, 7, 3, 1, 5, 3, 7, 5, 7, 7, 3, 1, 1, 3, 1, 5, 3
OFFSET
1,3
LINKS
FORMULA
a(n) = A010877(A000265(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 4. - Amiram Eldar, Aug 29 2024
MATHEMATICA
a[n_] := Mod[n / 2^IntegerExponent[n, 2], 8]; Array[a, 100] (* Amiram Eldar, Aug 29 2024 *)
PROG
(PARI) a(n) = (n>>valuation(n, 2))%8 \\Charles R Greathouse IV, May 14 2014
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, Oct 23 2004
STATUS
approved