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.

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

This page as a plain text file.
%I A182510 #12 May 11 2025 14:54:29
%S A182510 0,1,3,-1,-8,-2,0,9,1,-1,-12,0,24,21,3,-9,-28,-2,8,29,1,-9,-32,0,56,
%T A182510 33,3,-9,-24,-2,-8,-23,-47,7,84,112,0,-75,-109,-1,68,110,0,-67,-111,
%U A182510 -1,64,112,0,-63,-13,-1,-40,-18,0,73,113,-1,-172,-144,-8,85,115
%N A182510 a(0)=0, a(1)=1, a(n)=(a(n-1) XOR n) - a(n-2).
%C A182510 Conjectures: the sequence contains 8 zeros, and more positive terms than negative.
%H A182510 Charles R Greathouse IV, <a href="/A182510/b182510.txt">Table of n, a(n) for n = 0..10000</a>
%F A182510 a(0)=0, a(1)=1, a(n)=(a(n-1) XOR n) - a(n-2), where XOR is the bitwise exclusive-or operator.
%o A182510 (Python)
%o A182510 prpr = 0
%o A182510 prev = 1
%o A182510 for n in range(2,99):
%o A182510   current = (prev ^ n) - prpr
%o A182510   print(prpr, end=' ')
%o A182510   prpr = prev
%o A182510   prev = current
%o A182510 (PARI) v=vector(100);v[1]=0;v[2]=1;for(i=3,#v,v[i]=bitxor(v[i-1],i-1)-v[i-2]); v \\ _Charles R Greathouse IV_, May 03 2012
%Y A182510 Cf. A182509.
%K A182510 sign,easy
%O A182510 0,3
%A A182510 _Alex Ratushnyak_, May 03 2012