login
A045893
Solutions t to the equation s*prime(n) + t*prime(n+1) = 1 with |s| as small as possible.
1
1, -1, -2, 2, -5, -3, -8, 5, 4, -14, -5, -9, -20, 11, 8, 9, -29, -10, 17, -35, -12, 20, 14, -11, -24, -50, 26, -53, -27, -8, 32, 22, -68, 14, -74, -25, -26, 41, 28, 29, -89, -18, -95, -48, -98, 83, 88, 56, -113, -57, 39, -119, -24, 42, 43, 44, -134, -45, -69
OFFSET
1,3
MATHEMATICA
Table[ Part[ Part[ ExtendedGCD[ Prime[ i ], Prime[ i+1 ] ], 2 ], 2 ], {i, 50} ]
PROG
(PARI) a(n)=gcdext(prime(n), prime(n+1))[2] \\ Charles R Greathouse IV, Nov 16 2015
CROSSREFS
Cf. A045892.
Sequence in context: A088652 A368207 A266981 * A071939 A338332 A075545
KEYWORD
sign
EXTENSIONS
Name made stricter and terms updated and extended by Sean A. Irvine, Mar 24 2021
STATUS
approved