reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
nsp[n_] := Module[{k}, If[PrimeOmega[n] == 2, Return[n]]; For[k = 1, True, k++, If[n-k > 0 && PrimeOmega[n-k] == 2, Return[n-k]]; If[PrimeOmega[n+k] == 2, Return[n+k]]]];
a[n_] := a[n] = nsp[5^n] - 5^n;
Table[Print[n, " ", a[n]]; a[n], {n, 0, 76}] (* Jean-François Alcover, Jul 23 2020, after Maple *)
approved
editing
proposed
approved
editing
proposed
a(0)=3 and a(1)=-1 are the only terms == 3 (mod 4), as 5^n + 3 is divisible by 4. - Robert Israel, May 03 2018
proposed
editing
editing
proposed
3, -1, 0, -2, 1, 2, -2, -2, -2, -3, 2, 2, -2, -4, 4, 2, -8, -6, -2, -3, -2, -2, 4, 2, -6, -2, 4, 2, -3, 17, 9, -4, -8, -6, 12, 14, -2, -6, -8, -2, -6, 24, -2, 14, -6, -4, -18, -6, -3, -6, 16, -10, 16, -12, 12, -2, 16, 6, 16, -12, -2, -6, 12, -12, -8, -19, -6, 6, 24, -16, 4, 2, 16, -4, -8, -4, 16
sign,less,changed
More terms from Robert Israel, May 03 2018
Robert Israel, <a href="/A117430/b117430.txt">Table of n, a(n) for n = 0..111</a>
nsp:= proc(n) uses numtheory; local k;
if bigomega(n)=2 then return n fi;
for k from 1 do
if n-k > 0 and bigomega(n-k)=2 then return n-k fi;
if bigomega(n+k)=2 then return n+k fi
od
end proc:
seq(nsp(5^n)-5^n, n=0..30); # Robert Israel, May 03 2018
easy,sign,less
approved
editing