login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022458 a(n) = prime(2n-1) mod prime(n). 1
0, 2, 1, 3, 1, 5, 7, 9, 13, 9, 11, 9, 15, 17, 15, 21, 19, 27, 23, 25, 33, 33, 31, 33, 33, 31, 35, 43, 51, 51, 29, 45, 39, 53, 49, 51, 53, 53, 55, 55, 61, 69, 57, 63, 67, 69, 65, 53, 55, 65, 81, 85, 89, 85, 85, 81, 79, 89, 89, 91, 95, 91, 77, 87, 101, 105, 89, 87 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..10000

MATHEMATICA

Table[Mod[Prime[2n-1], Prime[n]], {n, 70}] (* Harvey P. Dale, Aug 10 2012 *)

PROG

(PARI) for(n=1, 50, print1(prime(2*n-1) % prime(n), ", ")) \\ G. C. Greubel, Feb 28 2018

(MAGMA) [NthPrime(2*n-1) mod NthPrime(n): n in [1..50]]; // G. C. Greubel, Feb 28 2018

CROSSREFS

Sequence in context: A336617 A341865 A321738 * A084419 A119606 A034850

Adjacent sequences:  A022455 A022456 A022457 * A022459 A022460 A022461

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 June 19 21:25 EDT 2021. Contains 345151 sequences. (Running on oeis4.)