login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Corresponding GCD values in A116894.
0

%I #6 Feb 20 2024 09:23:25

%S 2,10453,129341,157519,555097,595411,624363411431

%N Corresponding GCD values in A116894.

%F a(n) = gcd(A116894(n)! + 1, A116894(n)^A116894(n) + 1)

%o (PARI) for(n = 1, 10^9, x = gcd(n! + 1, n^n + 1); if(x != 1 && x != 2*n + 1, print1(x, ", ")))

%o (C) See Links section in A116893.

%Y Cf. A116894.

%K hard,more,nonn

%O 1,1

%A _Ryan Propper_, Feb 01 2008

%E a(6)-a(7) from _Nick Hobson_, Feb 20 2024