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 A203601 #19 May 21 2021 08:08:02 %S A203601 1,6,44,280,1712,10336,78528,610688,4745984,28476928,173222912, %T A203601 1108678656,6652604416,48774012928,292681859072,1757200613376, %U A203601 11780162781184,70685271916544,424730711293952,3116299774853120,19823698692276224,120070359807426560,720738827865423872 %N A203601 a(0)=1, a(n+1) = (a(n)*7) XOR a(n). %C A203601 A007814(a(n))=n. - _Robert Israel_, Mar 22 2020 %H A203601 Robert Israel, <a href="/A203601/b203601.txt">Table of n, a(n) for n = 0..1220</a> %F A203601 a(0)=1, a(n+1) = (a(n)*7) XOR a(n), where XOR is the bitwise exclusive-or operator. %p A203601 a[0]:= 1: %p A203601 for i from 1 to 50 do a[i]:= Bits:-Xor(a[i-1],a[i-1]*7) od: %p A203601 seq(a[i],i=0..50); # _Robert Israel_, Mar 22 2020 %o A203601 (Python) %o A203601 a=1 %o A203601 for n in range(55): %o A203601 print(a, end=',') %o A203601 a ^= a*7 %Y A203601 Cf. A001317: a(n+1) = (a(n)*2) XOR a(n). %Y A203601 Cf. A038183: a(n+1) = (a(n)*4) XOR a(n). %Y A203601 Cf. A182556: a(n+1) = (a(n)*6) XOR a(n). %Y A203601 Cf. A100311: a(n+1) = (a(n)*8) XOR a(n). %Y A203601 Cf. A007814. %K A203601 nonn,base,easy %O A203601 0,2 %A A203601 _Alex Ratushnyak_, May 06 2012