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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099548 Odd part of n modulo 7. 8
1, 1, 3, 1, 5, 3, 0, 1, 2, 5, 4, 3, 6, 0, 1, 1, 3, 2, 5, 5, 0, 4, 2, 3, 4, 6, 6, 0, 1, 1, 3, 1, 5, 3, 0, 2, 2, 5, 4, 5, 6, 0, 1, 4, 3, 2, 5, 3, 0, 4, 2, 6, 4, 6, 6, 0, 1, 1, 3, 1, 5, 3, 0, 1, 2, 5, 4, 3, 6, 0, 1, 2, 3, 2, 5, 5, 0, 4, 2, 5, 4, 6, 6, 0, 1, 1, 3, 4, 5, 3, 0, 2, 2, 5, 4, 3, 6, 0, 1, 4, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = A010876(A000265(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 3. - Amiram Eldar, Aug 29 2024
MATHEMATICA
a[n_] := Mod[n / 2^IntegerExponent[n, 2], 7]; Array[a, 100] (* Amiram Eldar, Aug 29 2024 *)
PROG
(PARI) a(n) = (n>>valuation(n, 2))%7 \\Charles R Greathouse IV, May 14 2014
CROSSREFS
Sequence in context: A249139 A059971 A184343 * A351556 A134743 A099547
KEYWORD
nonn,easy,changed
AUTHOR
Ralf Stephan, Oct 23 2004
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 10 04:30 EDT 2024. Contains 375773 sequences. (Running on oeis4.)