LINKS
Max Alekseyev, <a href="/A366671/b366671_1.txt">Table of n, a(n) for n = 0..16383</a>
The OEIS is supported by the many generous donors to the OEIS Foundation.
Max Alekseyev, <a href="/A366671/b366671_1.txt">Table of n, a(n) for n = 0..16383</a>
editing
approved
reviewed
approved
proposed
reviewed
editing
proposed
a(n) = A002586(3*n) for n >= 1. - Robert Israel, Nov 20 2023
a(n) = 3 if n is odd. a(n) = 5 if n == 2 (mod 4). - Robert Israel, Nov 20 2023
P1000:= mul(ithprime(i), i= 4..1000):
f:= proc(n) local t;
if n::odd then return 3 elif n mod 4 = 2 then return 5 fi;
t:= igcd(8^n+1, P1000);
if t <> 1 then min(numtheory:-factorset(t)) else min(numtheory:-factorset(8^n+1)) fi
end proc:
map(f, [$0..100]); # Robert Israel, Nov 20 2023
approved
editing
reviewed
approved
proposed
reviewed