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.

Showing 1-2 of 2 results.

A169813 a(n) = n XOR sigma(n), where sigma(n) is the number of divisors of n, A000203.

Original entry on oeis.org

0, 1, 7, 3, 3, 10, 15, 7, 4, 24, 7, 16, 3, 22, 23, 15, 3, 53, 7, 62, 53, 50, 15, 36, 6, 48, 51, 36, 3, 86, 63, 31, 17, 20, 19, 127, 3, 26, 31, 114, 3, 74, 7, 120, 99, 102, 31, 76, 8, 111, 123, 86, 3, 78, 127, 64, 105, 96, 7, 148, 3, 94, 87, 63, 21, 210, 7, 58, 37, 214, 15, 139, 3, 56
Offset: 1

Views

Author

N. J. A. Sloane, May 28 2010

Keywords

Crossrefs

Programs

A169814 a(n) = n XOR phi(n).

Original entry on oeis.org

0, 3, 1, 6, 1, 4, 1, 12, 15, 14, 1, 8, 1, 8, 7, 24, 1, 20, 1, 28, 25, 28, 1, 16, 13, 22, 9, 16, 1, 22, 1, 48, 53, 50, 59, 40, 1, 52, 63, 56, 1, 38, 1, 56, 53, 56, 1, 32, 27, 38, 19, 44, 1, 36, 31, 32, 29, 38, 1, 44, 1, 32, 27, 96, 113, 86, 1, 100, 105, 94, 1, 80, 1, 110, 99, 104, 113, 86
Offset: 1

Views

Author

N. J. A. Sloane, May 28 2010

Keywords

Crossrefs

Programs

Formula

a(n) = 1 <=> n in { A065091 }. - Alois P. Heinz, Jul 06 2023
Showing 1-2 of 2 results.