OFFSET
1,3
COMMENTS
a(2*k+1) is even for any k > 0.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
EXAMPLE
5 = prime(3); as 5 is coprime to 3, a(5) must be a multiple of 3; 5*3 = prime(3)*prime(2) does not belong to A120383 as it is not divisible by 2; so a(5) must also be divisible by 2; 5*3*2 belongs to A120383, hence a(5) = 3*2 = 6.
7 = prime(4); as 7 is coprime to 4, a(7) must be a multiple of 4; 7*4 belongs to A120383, hence a(7)=4.
PROG
(PARI) complete(n) = my (c=n); my (f=factor(n)); for (i=1, #f~, c = lcm(c, primepi(f[i, 1]))); return (c)
a(n) = my (m=n); while (1, my (mm=complete(m)); if (m==mm, return (m/n), m=mm))
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Apr 08 2017
STATUS
approved