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.

A182538 a(n) = (a(n-1) AND a(n-2)) + n.

Original entry on oeis.org

0, 1, 2, 3, 6, 7, 12, 11, 16, 9, 10, 19, 14, 15, 28, 27, 40, 25, 26, 43, 30, 31, 52, 43, 56, 65, 26, 27, 54, 47, 68, 35, 32, 65, 34, 35, 70, 39, 44, 75, 48, 41, 74, 51, 46, 79, 60, 59, 104, 89, 122, 139, 62, 63, 116, 107, 152, 65, 58, 59, 118, 111, 164, 99, 96, 161, 98, 99, 166, 103
Offset: 0

Views

Author

Alex Ratushnyak, May 04 2012

Keywords

Crossrefs

Cf. A182536.

Programs

  • PARI
    first(n)=my(res=vector(n,i,i-1)); for(x=3, n, res[x]=bitand(res[x-1],res[x-2])+x-1); res \\ Iain Fox, Nov 05 2018
  • Python
    prpr, prev = 0,1
    for n in range(2,99):
      current = (prpr & prev) + n
      print(prpr, end=', ')
      prpr, prev = prev, current
    

Formula

a(0)=0, a(1)=1, a(n)=(a(n-1) AND a(n-2)) + n, where AND is the bitwise AND operator.