OFFSET
2,1
LINKS
Robert Israel, Table of n, a(n) for n = 2..10000
FORMULA
a(n) = 8^(-1) (mod prime(n)) for n >= 2.
If prime(n) mod 8 = j in {1, 3, 5, 7}, then a(n) = (1 + (8-j)*prime(n))/8. - Robert Israel, Feb 24 2025
MAPLE
seq(1/8 mod ithprime(n), n=2..65); # Alois P. Heinz, Feb 14 2025
MATHEMATICA
a[n_] := ModularInverse[8, Prime[n]]; Array[a, 100, 2] (* Amiram Eldar, Feb 05 2025 *)
PROG
(PARI) a(n) = lift(1/Mod(8, prime(n))); \\ Michel Marcus, Jan 25 2025
(Python)
from sympy import prime
def A380421(n): return pow(8, -1, prime(n)) # Chai Wah Wu, Feb 14 2025
CROSSREFS
KEYWORD
nonn,look
AUTHOR
R. J. Cintra, Jan 25 2025
STATUS
approved