The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070332 Smallest nontrivial power of n ending in n and greater than n; or 0 if no such number exists. 1
 32, 243, 64, 25, 36, 16807, 32768, 729, 0, 285311670611, 46005119909369701466112, 247064529073450392704413, 0, 0, 16777216, 69091933913008732880827217, 0, 116490258898219, 0, 85766121, 0, 39471584120695485887249589623, 13824, 625, 0, 1144561273430837494885949696427 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS a(10k) = 0; a(5k)= 0 in case k is not congruent to ==0 mod 5.{ a(25) = 625 but a(15) = a(35) = 0}. a(n) = 0 if n == 2 (mod 4) and n >= 10. - Robert Israel, Feb 14 2021 LINKS Robert Israel, Table of n, a(n) for n = 2..1002 EXAMPLE a(15) = 0, a(16) = 16777216. MAPLE f:= proc(n) local x, R, v;    R:= msolve(n^x=n, 10^(1+ilog10(n)));    if R = {x=1} then return 0 fi;    v:= indets(R, name) minus {x};    if nops(v) = 1 then subs(subs(v[1]=1, R[1]), n^x)    else error    fi end proc: map(f, [\$2..100]); # Robert Israel, Feb 14 2021 CROSSREFS Sequence in context: A118999 A321829 A111450 * A111442 A104782 A186774 Adjacent sequences:  A070329 A070330 A070331 * A070333 A070334 A070335 KEYWORD base,nonn AUTHOR Amarnath Murthy, May 11 2002 EXTENSIONS More terms from Robert Israel, Feb 14 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 23 21:10 EDT 2021. Contains 346265 sequences. (Running on oeis4.)