|
%I #19 Nov 05 2022 04:34:50
%S 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,
%T 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,
%U 0,1,3,0,1,2,3,1,1,2,4,0,0,1,3,0,1,2
%N n mod (number of ones in binary representation of n).
%C a(A049445(n)) = 0;
%C a(n) = n - A161764(n);
%C a(A199262(n)) = n and a(m) <> n for m < A199262(n).
%H Reinhard Zumkeller, <a href="/A199238/b199238.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%t Mod[#,DigitCount[#,2,1]]&/@Range[90] (* _Harvey P. Dale_, Nov 08 2011 *)
%o (Haskell)
%o a199238 n = a199238_list !! (n-1)
%o a199238_list = zipWith mod [1..] $ tail a000120_list
%o (PARI) A199238(n)=n%norml2(binary(n)) \\ _M. F. Hasler_, Oct 09 2012
%Y Cf. A000120, A070635, A049445, A161764, A199262.
%K nonn
%O 1,11
%A _Reinhard Zumkeller_, Nov 04 2011
|
