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

%I

%S 32,243,64,25,36,16807,32768,729,0,285311670611,

%T 46005119909369701466112,247064529073450392704413,0,0,16777216,

%U 69091933913008732880827217,0,116490258898219,0,85766121,0,39471584120695485887249589623,13824,625,0,1144561273430837494885949696427

%N Smallest nontrivial power of n ending in n and greater than n; or 0 if no such number exists.

%C 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}.

%C a(n) = 0 if n == 2 (mod 4) and n >= 10. - _Robert Israel_, Feb 14 2021

%H Robert Israel, <a href="/A070332/b070332.txt">Table of n, a(n) for n = 2..1002</a>

%e a(15) = 0, a(16) = 16777216.

%p f:= proc(n) local x,R,v;

%p R:= msolve(n^x=n, 10^(1+ilog10(n)));

%p if R = {x=1} then return 0 fi;

%p v:= indets(R,name) minus {x};

%p if nops(v) = 1 then subs(subs(v[1]=1,R[1]),n^x)

%p else error

%p fi

%p end proc:

%p map(f, [\$2..100]); # _Robert Israel_, Feb 14 2021

%K base,nonn

%O 2,1

%A _Amarnath Murthy_, May 11 2002

%E More terms from _Robert Israel_, Feb 14 2021

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 September 21 21:32 EDT 2021. Contains 347605 sequences. (Running on oeis4.)