cp's OEIS Frontend

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.

A182537 a(0)=0, a(1)=1, a(n) = a(n-1) + (a(n-2) XOR n).

This page as a plain text file.
%I A182537 #23 May 21 2025 10:44:44
%S A182537 0,1,3,5,12,12,22,33,63,103,156,264,408,669,1075,1733,2792,4540,7350,
%T A182537 11877,19207,31095,50312,81384,131704,213097,344779,557885,902676,
%U A182537 1460532,2363198,3823721,6186887,10010575,16197492,26208096,42405552,68613621,111019147,179632733
%N A182537 a(0)=0, a(1)=1, a(n) = a(n-1) + (a(n-2) XOR n).
%H A182537 Harvey P. Dale, <a href="/A182537/b182537.txt">Table of n, a(n) for n = 0..1000</a>
%F A182537 a(0)=0, a(1)=1, a(n) = a(n-1) + (a(n-2) XOR n), where XOR is the bitwise exclusive-or operator.
%t A182537 nxt[{n_,a_,b_}]:={n+1,b,b+BitXor[a,n+1]}; NestList[nxt,{1,0,1},40][[All,2]] (* _Harvey P. Dale_, Jul 02 2021 *)
%o A182537 (Python)
%o A182537 prpr, prev = 0, 1
%o A182537 for n in range(2, 99):
%o A182537   current = prev + (prpr ^ n)
%o A182537   print(prpr, end=', ')
%o A182537   prpr, prev = prev, current
%Y A182537 Cf. A182509, A182536.
%K A182537 nonn,base,easy
%O A182537 0,3
%A A182537 _Alex Ratushnyak_, May 04 2012