OFFSET
1,2
COMMENTS
For n > 1, a(n) = n iff n is prime.
a(n) is n times the least common multiple of the proper divisors of n, a(n) = n*A048671(n). - Peter Luschny, Jun 22 2011
FORMULA
A140579^(-1) * (1, 4, 9, 16, 25, ...).
EXAMPLE
MAPLE
A140651 := n -> n*ilcm(op(numtheory[divisors](n) minus {1, n})); seq(A140651(i), i=1..60); # Peter Luschny, Jun 22 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Gary W. Adamson and Mats Granvik, May 20 2008
EXTENSIONS
a(15)-a(60) from Peter Luschny, Jun 22 2011
STATUS
approved