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.

A318468 a(n) = 2*n AND A000203(n), where AND is bitwise-and (A004198) and A000203 = sum of divisors.

Original entry on oeis.org

0, 0, 4, 0, 2, 12, 8, 0, 0, 16, 4, 24, 10, 24, 24, 0, 2, 36, 4, 40, 32, 36, 8, 48, 18, 32, 32, 56, 26, 8, 32, 0, 0, 4, 0, 72, 2, 12, 8, 80, 2, 64, 4, 80, 74, 72, 16, 96, 32, 68, 64, 96, 34, 104, 72, 112, 80, 80, 52, 40, 58, 96, 104, 0, 0, 128, 4, 8, 0, 128, 8, 128, 2, 16, 20, 136, 0, 136, 16, 160, 32, 36, 4, 160, 40, 132, 40, 176, 18, 160, 48
Offset: 1

Views

Author

Antti Karttunen, Aug 26 2018

Keywords

Crossrefs

Programs

  • Mathematica
    Array[BitAnd[2 #, DivisorSigma[1, #]] &, 91] (* Michael De Vlieger, Apr 21 2019 *)
  • PARI
    A318468(n) = bitand(2*n,sigma(n));

Formula

a(n) = A004198(2*n, A000203(n)).
a(n) = A224880(n) - A318466(n) = (A224880(n)-A318467(n))/2.