login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A057899
Smallest positive integer such that n=a(n)^k-k with k a positive integer.
2
2, 2, 4, 5, 2, 7, 3, 9, 10, 11, 12, 2, 14, 4, 16, 17, 18, 19, 20, 21, 22, 23, 5, 3, 26, 27, 2, 29, 30, 31, 32, 33, 34, 6, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 7, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 2, 60, 61, 4, 8, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76
OFFSET
1,1
COMMENTS
It may be that positive integers can be written as n=m^k-k (with m and k > 1) in at most one way [checked up to 10000] as well as with k=1 and m=n+1.
FORMULA
a(n) = (n+A057898(n))^(1/A057898(n)).
EXAMPLE
a(5)=2 since 5=2^3-3
CROSSREFS
Sequence in context: A201509 A109295 A211188 * A210200 A119989 A137605
KEYWORD
nonn
AUTHOR
Henry Bottomley, Sep 26 2000
STATUS
approved