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.

A360562 a(n) is the least k such that k*n is a Zumkeller number (A083207).

Original entry on oeis.org

6, 3, 2, 3, 4, 1, 4, 3, 6, 2, 6, 1, 6, 2, 2, 3, 6, 3, 6, 1, 2, 3, 6, 1, 6, 3, 2, 1, 6, 1, 6, 3, 2, 3, 2, 3, 6, 3, 2, 1, 6, 1, 6, 2, 2, 3, 6, 1, 6, 3, 2, 2, 6, 1, 4, 1, 2, 3, 6, 1, 6, 3, 2, 3, 4, 1, 6, 3, 2, 1, 6, 3, 6, 3, 2, 3, 4, 1, 6, 1, 6, 3, 6, 1, 4, 3, 2
Offset: 1

Views

Author

Rémy Sigrist, Feb 11 2023

Keywords

Comments

This sequence is well defined (see A360561).
The values among the first 200000 terms are distributed as follows:
v # of occurrences
- ----------------
1 45927
2 45015
3 41953
4 18109
5 10
6 48986

Crossrefs

Programs

  • PARI
    a(n) = { for (k=1, oo, if (is(k*n), return (k))) } \\ see A083207 for the function "is"

Formula

1 <= a(n) <= 6.
a(n) = A360561(n) / n.
a(n) = 1 iff n belongs to A083207.