id:A086484 - OEIS Search Results

Search: id:A086484

Displaying 1-1 of 1 results found.

page 1

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
1

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; listen)

	OFFSET	`1,1`
	PROGRAM	`(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: A129159 A095830 A101621 this_sequence A091335 A140946 A008741` `Adjacent sequences: A086481 A086482 A086483 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research