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.

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

This page as a plain text file.
%I A182536 #10 Nov 06 2024 15:26:51
%S A182536 0,1,3,5,10,20,36,55,27,53,56,24,44,65,123,73,66,28,112,127,35,113,
%T A182536 104,48,112,89,67,53,146,196,116,207,219,53,272,328,124,345,331,57,
%U A182536 410,460,128,375,547,897,464,640,896,305,739,1029,1818,852,1156,2055,3259,1269,2184,3256,1132,2321,3515,1257,2450,3516,1136,2575
%N A182536 a(0)=0, a(1)=1, a(n)=(a(n-1) XOR a(n-2)) + n.
%F A182536 a(0)=0, a(1)=1, a(n)=(a(n-1) XOR a(n-2)) + n, where XOR is the bitwise exclusive-or operator.
%o A182536 (Python)
%o A182536 prpr, prev = 0,1
%o A182536 for n in range(2,99):
%o A182536     current = (prpr ^ prev) + n
%o A182536     print(prpr, end=', ')
%o A182536     prpr, prev = prev, current
%Y A182536 Cf. A114375, A182509.
%K A182536 nonn,base,easy
%O A182536 0,3
%A A182536 _Alex Ratushnyak_, May 04 2012