A308090 - OEIS

A308090

a(n) = gcd(2^n + n!, 3^n + n!, n+1).

1, 1, 1, 5, 1, 7, 1, 1, 1, 11, 1, 13, 1, 1, 1, 17, 1, 19, 1, 1, 1, 23, 1, 1, 1, 1, 1, 29, 1, 31, 1, 1, 1, 1, 1, 37, 1, 1, 1, 41, 1, 43, 1, 1, 1, 47, 1, 1, 1, 1, 1, 53, 1, 1, 1, 1, 1, 59, 1, 61, 1, 1, 1, 1, 1, 67, 1, 1, 1, 71, 1, 73, 1, 1, 1, 1, 1, 79, 1, 1, 1, 83, 1, 1, 1, 1, 1, 89, 1, 1, 1, 1, 1, 1, 1, 97, 1, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

From observation: For n > 3, if n+1 is prime, then a(n) = n+1.

This implies that (2^n + n!)= 0 mod (n+1) iff (n+1) is prime, and (3^n + n!)= 0 mod (n+1) iff (n+1) is prime.

Conjecture: Conversely, if gcd(2^n + n!, 3^n + n!, n+1) = n+1, then n+1 is prime.

Appears to be the same as A090585(n) except at n=2. - R. J. Mathar, Jul 22 2021

LINKS

Table of n, a(n) for n=1..99.

FORMULA

a(n) = gcd(A007611(n), A249945(n), n+1).