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.

A182417 a(0)=0, a(n+1) = (a(n) XOR floor(a(n)/4)) + 1, where XOR is the bitwise exclusive-or operator.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 8, 11, 10, 9, 12, 16, 21, 17, 22, 20, 18, 23, 19, 24, 31, 25, 32, 41, 36, 46, 38, 48, 61, 51, 64, 81, 70, 88, 79, 93, 75, 90, 77, 95, 73, 92, 76, 96, 121, 104, 115, 112, 109, 119, 107, 114, 111, 117, 105, 116, 106, 113, 110, 118, 108
Offset: 0

Views

Author

Alex Ratushnyak, Apr 27 2012

Keywords

Comments

As n -> infinity, a(n) -> infinity.

Crossrefs

Cf. A182310.

Programs

  • Mathematica
    NestList[BitXor[#, Quotient[#, 4]] + 1 &, 0, 60] (* Ivan Neretin, Sep 03 2015 *)
  • PARI
    N=100; v=vector(N);
    for (n=1, N-1, v[n+1] = bitxor( v[n], v[n] \ 8 ) + 1 );
    v /* show terms */
    /* Joerg Arndt, Apr 28 2012 */