|
Search: id:A134656
|
|
| |
| |
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n) = gcd(A116894(n)! + 1, A116894(n)^A116894(n) + 1)
|
|
PROGRAM
|
(PARI) for(n = 1, 10^9, x = gcd(n! + 1, n^n + 1); if(x != 1 && x != 2*n + 1, print1(x, ", ")))
|
|
CROSSREFS
|
Cf. A116894.
Sequence in context: A104904 A086563 A023328 this_sequence A128122 A082178 A082912
Adjacent sequences: A134653 A134654 A134655 this_sequence A134657 A134658 A134659
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Ryan Propper (rpropper(AT)cs.stanford.edu), Feb 01 2008
|
|
|
Search completed in 0.002 seconds
|
