login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182556 a(0)=1, a(n+1) = (a(n)*6) XOR a(n). 1

%I #8 Nov 23 2012 16:39:36

%S 1,7,45,291,2033,10327,55901,377971,2580161,13329991,68092909,

%T 475337827,3047910961,21335374615,108342024605,611555770419,

%U 4227169747201,22855656310535,114836769975597,592467546841635,4147130288467697,24449879086004055,171122765320764253

%N a(0)=1, a(n+1) = (a(n)*6) XOR a(n).

%F a(0)=1, a(n+1) = (a(n)*6) XOR a(n), where XOR is the bitwise exclusive-or operator.

%t NestList[BitXor[6#,#]&,1,30] (* _Harvey P. Dale_, Nov 23 2012 *)

%o (Python)

%o a=1

%o for n in range(55):

%o . print a,

%o . a ^= a*6

%Y Cf. A001317: a(n+1) = (a(n)*2) XOR a(n).

%Y Cf. A038183: a(n+1) = (a(n)*4) XOR a(n).

%Y Cf. A100311: a(n+1) = (a(n)*8) XOR a(n).

%K nonn,base,easy

%O 0,2

%A _Alex Ratushnyak_, May 05 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)