login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045893 Solutions t to the equation s*prime(n) + t*prime(n+1) = 1 with |s| as small as possible. 1

%I #10 Mar 24 2021 22:16:31

%S 1,-1,-2,2,-5,-3,-8,5,4,-14,-5,-9,-20,11,8,9,-29,-10,17,-35,-12,20,14,

%T -11,-24,-50,26,-53,-27,-8,32,22,-68,14,-74,-25,-26,41,28,29,-89,-18,

%U -95,-48,-98,83,88,56,-113,-57,39,-119,-24,42,43,44,-134,-45,-69

%N Solutions t to the equation s*prime(n) + t*prime(n+1) = 1 with |s| as small as possible.

%t Table[ Part[ Part[ ExtendedGCD[ Prime[ i ], Prime[ i+1 ] ], 2 ], 2 ], {i, 50} ]

%o (PARI) a(n)=gcdext(prime(n),prime(n+1))[2] \\ _Charles R Greathouse IV_, Nov 16 2015

%Y Cf. A045892.

%K sign

%O 1,3

%A _Ralf W. Grosse-Kunstleve_

%E Name made stricter and terms updated and extended by _Sean A. Irvine_, Mar 24 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 00:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)