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.

A054013 Chowla function of n read modulo n.

Original entry on oeis.org

0, 0, 0, 2, 0, 5, 0, 6, 3, 7, 0, 3, 0, 9, 8, 14, 0, 2, 0, 1, 10, 13, 0, 11, 5, 15, 12, 27, 0, 11, 0, 30, 14, 19, 12, 18, 0, 21, 16, 9, 0, 11, 0, 39, 32, 25, 0, 27, 7, 42, 20, 45, 0, 11, 16, 7, 22, 31, 0, 47, 0, 33, 40, 62, 18, 11, 0, 57, 26, 3, 0, 50, 0, 39, 48, 63, 18, 11, 0, 25, 39, 43, 0
Offset: 1

Views

Author

Asher Auel, Jan 17 2000

Keywords

Comments

Chowla's function (A048050) = sum of divisors of n except 1 and n.

Crossrefs

Programs

  • Maple
    with(numtheory): [seq((sigma(i) - i - 1) mod i, i=2..100)];
  • Mathematica
    Table[Mod[DivisorSigma[1,n]-n-1,n],{n,90}] (* Harvey P. Dale, Dec 01 2011 *)
  • PARI
    A054013(n) = ((sigma(n)-n-1) % n); \\ Antti Karttunen, Oct 30 2017

Formula

a(n) = A048050(n) mod n