OFFSET
1,2
COMMENTS
a(n) = (smallest multiple larger than the sum of the terms with index which are the divisors (<n) of n) - (The sum of the terms with index which are the divisors ( <n ) of n) if the resulting number is not already included, else go for the next larger multiple.
LINKS
Paul Tek, Table of n, a(n) for n = 1..10000
EXAMPLE
9 divides a(1) + a(3) + a(9) = 1 + 2 + 15 = 18.
PROG
(PARI) A = vector(105); used = vector(400); for (n = 1, 105, d = divisors(n); c = numdiv(n); s = 0; for (i = 1, c - 1, s += A[d[i]]); x = n - s%n; while (used[x], x += n); A[n] = x; used[x] = 1; write("a083165.txt", (x + s)/n)); write("a083164.txt", A)
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Amarnath Murthy, Apr 25 2003
EXTENSIONS
More terms from David Wasserman, Oct 22 2004
STATUS
approved