login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022460 a(n) = prime(3*n) mod prime(n). 1
1, 1, 3, 2, 3, 9, 5, 13, 11, 26, 13, 3, 3, 9, 9, 11, 56, 7, 1, 68, 15, 1, 15, 3, 88, 94, 7, 5, 13, 11, 106, 110, 112, 1, 124, 140, 136, 130, 142, 140, 140, 158, 154, 164, 170, 190, 178, 158, 172, 176, 184, 194, 214, 200, 206, 208, 212, 220, 220, 226, 244 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

FORMULA

a(n) = A031336(n) modulo A000040(n). - Michel Marcus, Sep 30 2013

MATHEMATICA

Table[Mod[Prime[3 n], Prime[n]], {n, 100}] (* Vincenzo Librandi, Dec 09 2014 *)

PROG

(PARI) a(n) = prime(3*n) % prime(n); \\ Michel Marcus, Sep 30 2013

(MAGMA) [NthPrime(3*n) mod NthPrime(n): n in [1..90]]; // Vincenzo Librandi, Dec 09 2014

CROSSREFS

Sequence in context: A191628 A261999 A216829 * A010605 A120879 A118064

Adjacent sequences:  A022457 A022458 A022459 * A022461 A022462 A022463

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 02:32 EST 2018. Contains 317332 sequences. (Running on oeis4.)