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.

A182390 a(0)=0, a(n) = (a(n-1) * n) XOR n.

Original entry on oeis.org

0, 1, 0, 3, 8, 45, 264, 1855, 14832, 133497, 1334960, 14684571, 176214856, 2290793125, 32071103752, 481066556279, 7697064900448, 130850103307633, 2355301859537376, 44750735331210163, 895014706624203240, 18795308839108268061, 413496794460381897320
Offset: 0

Views

Author

Alex Ratushnyak, Apr 27 2012

Keywords

Comments

For 0A000240(n-1).

Crossrefs

Programs

  • Mathematica
    nxt[{n_,a_}]:={n+1,BitXor[a(n+1),n+1]}; NestList[nxt,{0,0},30][[;;,2]] (* Harvey P. Dale, Mar 14 2023 *)
  • Python
    a=0
    for i in range(1,55):
        print(a, end=', ')
        a *= i
        a ^= i

Formula

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