A199262 -id:A199262 - cp's OEIS frontend

A199238 n mod (number of ones in binary representation of n).

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

Offset: 1

Reinhard Zumkeller, Nov 04 2011

nonn

a(A049445(n)) = 0;
a(n) = n - A161764(n);
a(A199262(n)) = n and a(m) <> n for m < A199262(n).

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for sequences related to binary expansion of n

Cf. A000120, A070635, A049445, A161764, A199262.

a199238 n = a199238_list !! (n-1)
a199238_list = zipWith mod [1..] $ tail a000120_list

Mod[#,DigitCount[#,2,1]]&/@Range[90] (* Harvey P. Dale, Nov 08 2011 *)

A199238(n)=n%norml2(binary(n))  \\ M. F. Hasler, Oct 09 2012

A138791 Least number k such that A070635(k) = n.

Original entry on oeis.org

1, 11, 16, 15, 14, 38, 34, 29, 28, 19, 49, 76, 68, 98, 269, 79, 458, 397, 379, 299, 779, 769, 689, 898, 799, 3889, 4898, 5599, 6698, 7996, 8798, 9599, 19888, 16999, 18899, 67979, 58898, 39899, 59998, 49999, 89789, 189989, 89998, 98999, 489898, 298999

Offset: 0

Robert G. Wilson v, Mar 29 2008

A070635(a(n)) = n and A070635(m) <> n for m < a(n).

Least k such that k mod A007953(k) = n. - Robert Israel, Dec 29 2015

			a(2) = 16: 1+6 = 7 and 16 mod 7 = 2. - _Robert Israel_, Dec 30 2015

Robert G. Wilson v and Robert Israel, Table of n, a(n) for n = 0..514(n = 0..79 from Robert G. Wilson v)

Cf. A007953,A070635, A138792.

Cf. A199262.

a199263 n = (fromJust $ elemIndex n a070635_list) + 1
-- Reinhard Zumkeller, Nov 07 2011

extend:= proc(d, x, sx)
global A, nmin;
local y, n, tmax;
if d = 0 then
    n:= x mod sx;
    if not assigned(A[n]) then
       A[n]:= x;
       if n = nmin then
         for nmin from n while assigned(A[nmin]) do od:
       fi;
    fi
else
  tmax:= 9*d + sx;
  if nmin >= tmax then return fi;
  for y from max(0, nmin + 10 - tmax) to 9 do
    procname(d-1,10*x+y,sx+y)
  od:
fi
end proc:
A[0]:= 1:
nmin:= 1:
for d from 2 while nmin < 101 do
   extend(d,0,0)
od:
seq(A[i],i=0..nmin-1); # Robert Israel, Dec 29 2015

t = Table[0, {100}]; Do[ a = Mod[n, Plus @@ IntegerDigits@n]; If[a < 100 && t[[a + 1]] == 0, t[[a + 1]] = n; Print[{a, n}]], {n, 2^31}]
lnk[n_]:=Module[{k=1},While[Mod[k,Total[IntegerDigits[k]]]!=n,k++];k]; Array[lnk, 50, 0] (* Harvey P. Dale, Oct 11 2014 *)

Definition corrected by Robert Israel, Dec 29 2015

cp's OEIS Frontend

A199238 n mod (number of ones in binary representation of n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

PARI