

A086484


Let k be the largest number such that n is a kth power; then m is the least positive number such that m+n is a (k+1)th power.


0



2, 1, 4, 4, 3, 2, 8, 18, 6, 5, 4, 3, 2, 1, 16, 8, 7, 6, 5, 4, 3, 2, 1, 2, 10, 54, 8, 7, 6, 5, 32, 3, 2, 1, 28, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 64, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 162, 18, 17, 16, 15, 14, 13, 12, 11, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS

Table of n, a(n) for n=1..89.


PROG

(PARI) for (n = 2, 100, f = factor(n); g = f[1, 2]; for (i = 2, matsize(f)[1], g = gcd(g, f[i, 2])); x = sqrtn(n, g+1); print(round(ceil(x))^(g + 1)  n)); (Wasserman)


CROSSREFS

Sequence in context: A095830 A193915 A101621 * A091335 A274883 A140946
Adjacent sequences: A086481 A086482 A086483 * A086485 A086486 A086487


KEYWORD

nonn


AUTHOR

Amarnath Murthy, Jul 26 2003


EXTENSIONS

More terms from David Wasserman, Mar 07 2005


STATUS

approved



