login
This site is supported by donations 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). 1
-1, 2, 3, -3, 6, 4, 9, -6, -5, 15, 6, 10, 21, -12, -9, -10, 30, 11, -18, 36, 13, -21, -15, 12, 25, 51, -27, 54, 28, 9, -33, -23, 69, -15, 75, 26, 27, -42, -29, -30, 90, 19, 96, 49, 99, 123, 130, -57, 114, 58 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..50.

MATHEMATICA

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

PROG

(PARI) a(n)=gcdext(prime(n), prime(n+1))[1] \\ Charles R Greathouse IV, Nov 16 2015

CROSSREFS

Cf. A045893.

Sequence in context: A173739 A062774 A266286 * A160791 A115973 A057047

Adjacent sequences:  A045889 A045890 A045891 * A045893 A045894 A045895

KEYWORD

sign

AUTHOR

Ralf W. Grosse-Kunstleve

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 15 11:18 EST 2019. Contains 329144 sequences. (Running on oeis4.)