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.

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

Original entry on oeis.org

1, 7, 45, 291, 2033, 10327, 55901, 377971, 2580161, 13329991, 68092909, 475337827, 3047910961, 21335374615, 108342024605, 611555770419, 4227169747201, 22855656310535, 114836769975597, 592467546841635, 4147130288467697, 24449879086004055, 171122765320764253
Offset: 0

Views

Author

Alex Ratushnyak, May 05 2012

Keywords

Crossrefs

Cf. A001317: a(n+1) = (a(n)*2) XOR a(n).
Cf. A038183: a(n+1) = (a(n)*4) XOR a(n).
Cf. A100311: a(n+1) = (a(n)*8) XOR a(n).

Programs

  • Mathematica
    NestList[BitXor[6#,#]&,1,30] (* Harvey P. Dale, Nov 23 2012 *)
  • Python
    a=1
    for n in range(55):
        print(a, end=', ')
        a ^= a*6

Formula

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