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.

A054017 Chowla's function of n modulo n is a square (excluding 0's).

Original entry on oeis.org

14, 20, 39, 40, 46, 55, 80, 94, 100, 104, 117, 130, 155, 158, 183, 190, 200, 203, 291, 292, 295, 299, 320, 323, 334, 416, 430, 446, 464, 475, 488, 530, 539, 549, 567, 579, 583, 638, 650, 695, 718, 799, 873, 878, 890, 943, 955, 959, 964, 979, 1030, 1118
Offset: 1

Views

Author

Asher Auel, Jan 19 2000

Keywords

Comments

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

Crossrefs

Programs

  • Mathematica
    aQ[n_] := (c = DivisorSigma[1, n] - n - 1) > 0 && IntegerQ @ Sqrt @ Mod[c, n]; Select[Range[1000], aQ] (* Amiram Eldar, Aug 28 2019 *)