login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086484 Let k be the largest number such that n is a k-th 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; internal format)
OFFSET

1,1

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 A140946 A008741

Adjacent sequences:  A086481 A086482 A086483 * A086485 A086486 A086487

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 26 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Mar 07 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:21 EST 2012. Contains 205785 sequences.