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!)
A199238 n mod (number of ones in binary representation of n). 8
0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 2, 3, 0, 1, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 1, 1, 2, 1, 0, 1, 0, 2, 0, 1, 2, 3, 0, 2, 0, 3, 2, 1, 2, 2, 0, 1, 2, 3, 1, 1, 2, 0, 2, 1, 2, 4, 0, 1, 2, 3, 0, 1, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 1, 1, 2, 4, 0, 0, 1, 3, 0, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,11
COMMENTS
a(A049445(n)) = 0;
a(n) = n - A161764(n);
a(A199262(n)) = n and a(m) <> n for m < A199262(n).
LINKS
MATHEMATICA
Mod[#, DigitCount[#, 2, 1]]&/@Range[90] (* Harvey P. Dale, Nov 08 2011 *)
PROG
(Haskell)
a199238 n = a199238_list !! (n-1)
a199238_list = zipWith mod [1..] $ tail a000120_list
(PARI) A199238(n)=n%norml2(binary(n)) \\ M. F. Hasler, Oct 09 2012
CROSSREFS
Sequence in context: A127711 A336937 A069584 * A346698 A352515 A181347
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Nov 04 2011
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 February 27 12:16 EST 2024. Contains 370375 sequences. (Running on oeis4.)