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!)
A045892 Solutions s to the equation 1=s*prime(n)+t*prime(n+1) with |s| as small as possible. 1

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

%S -1,2,3,-3,6,4,9,-6,-5,15,6,10,21,-12,-9,-10,30,11,-18,36,13,-21,-15,

%T 12,25,51,-27,54,28,9,-33,-23,69,-15,75,26,27,-42,-29,-30,90,19,96,49,

%U 99,-88,-93,-57,114,58,-40,120,25,-43,-44,-45,135,46,70,141,-88

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

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

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

%Y Cf. A045893.

%K sign

%O 1,2

%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 March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)