The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A360562 a(n) is the least k such that k*n is a Zumkeller number (A083207). 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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
LINKS
FORMULA
1 <= a(n) <= 6.
a(n) = A360561(n) / n.
a(n) = 1 iff n belongs to A083207.
PROG
(PARI) a(n) = { for (k=1, oo, if (is(k*n), return (k))) } \\ see A083207 for the function "is"
CROSSREFS
Sequence in context: A068924 A106224 A254571 * A244815 A226579 A129203
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Feb 11 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 12:24 EDT 2024. Contains 372540 sequences. (Running on oeis4.)