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.

A359635 a(n) = A162657(n)/n.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 4, 1, 8, 3, 1, 1, 26, 1, 24, 1, 4, 1, 3, 1, 2, 1, 7, 1, 6, 1, 1, 3, 2, 1, 1, 1, 4, 1, 2, 1, 32, 1, 4, 18, 8, 1, 4, 1, 1, 9, 2, 1, 3, 1, 8, 1, 2, 1, 156, 1, 32, 1, 1, 1, 312, 1, 2, 3, 14, 1, 26, 1, 2, 1, 4, 1, 8, 1, 2, 1, 2, 1, 21, 1, 4, 3, 4, 1, 792
Offset: 1

Views

Author

Michel Marcus, Jan 09 2023

Keywords

Comments

A162657(n) is the least k such that denominator(sigma(k)/k) = n, so it is divisible by n.

Crossrefs

Cf. A162657.

Programs

  • PARI
    a(n) = my(k=1); while (denominator(sigma(k)/k) != n, k++); k/n;