This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A161441 #9 Dec 01 2021 08:43:02 %S A161441 1,16,35,50,69,84,103,118,137,152,171,186,205,220,239,254,256,273,290, %T A161441 307,324,341,358,375,392,409,426,443,460,477,494,511,515,530,545,560, %U A161441 583,598,613,628,651,666,681,696,719,734,749,764,770,787,800,817,838 %N A161441 Numbers n such that A160700(n) = 1. %H A161441 Charles R Greathouse IV, <a href="/A161441/b161441.txt">Table of n, a(n) for n = 1..10000</a> %F A161441 16n - 16 <= a(n) <= 16n - 1. - _Charles R Greathouse IV_, Jan 25 2018 %t A161441 b[n_] := b[n] = If[n < 16, n, b[Floor[n/16]]~BitXor~Mod[n, 16]]; %t A161441 Select[Range[0, 1000], b[#] == 1&] (* _Jean-François Alcover_, Dec 01 2021 *) %o A161441 (PARI) A160700(n)=my(t=n%16); while(n>15, n>>=4; t=bitxor(t, n%16)); t %o A161441 a(n)=for(k=16*n-16,16*n-1, if(a(k)==1, return(k))) \\ _Charles R Greathouse IV_, Jan 25 2018 %Y A161441 A001025 is a subsequence. %Y A161441 Cf. A161440, A161442, A161443, A161444, A161445, A161446, A161447, A161448, A161449, A161450, A161451, A161452, A161453, A161454, A161455. %K A161441 nonn,easy %O A161441 1,2 %A A161441 _Reinhard Zumkeller_, Jun 10 2009