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”).

A161440
Numbers m such that A160700(m) = 0.
17
0, 17, 34, 51, 68, 85, 102, 119, 136, 153, 170, 187, 204, 221, 238, 255, 257, 272, 291, 306, 325, 340, 359, 374, 393, 408, 427, 442, 461, 476, 495, 510, 514, 531, 544, 561, 582, 599, 612, 629, 650, 667, 680, 697, 718, 735, 748, 765, 771, 786, 801, 816, 839
OFFSET
1,2
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
FORMULA
16n - 16 <= a(n) <= 16n - 1. - Charles R Greathouse IV, Jan 25 2018
MATHEMATICA
b[n_] := b[n] = If[n < 16, n, b[Floor[n/16]]~BitXor~Mod[n, 16]];
Select[Range[0, 1000], b[#] == 0&] (* Jean-François Alcover, Dec 01 2021 *)
PROG
(PARI) A160700(n)=my(t=n%16); while(n>15, n>>=4; t=bitxor(t, n%16)); t
a(n)=for(k=16*n-16, 16*n-1, if(a(k)==0, return(k))) \\ Charles R Greathouse IV, Jan 25 2018
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Jun 10 2009
STATUS
approved