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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022460 a(n) = prime(3*n) mod prime(n). 1

%I

%S 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,

%T 13,11,106,110,112,1,124,140,136,130,142,140,140,158,154,164,170,190,

%U 178,158,172,176,184,194,214,200,206,208,212,220,220,226,244

%N a(n) = prime(3*n) mod prime(n).

%H G. C. Greubel, <a href="/A022460/b022460.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A031336(n) modulo A000040(n). - _Michel Marcus_, Sep 30 2013

%t Table[Mod[Prime[3 n], Prime[n]], {n, 100}] (* _Vincenzo Librandi_, Dec 09 2014 *)

%o (PARI) a(n) = prime(3*n) % prime(n); \\ _Michel Marcus_, Sep 30 2013

%o (MAGMA) [NthPrime(3*n) mod NthPrime(n): n in [1..90]]; // _Vincenzo Librandi_, Dec 09 2014

%K nonn

%O 1,3

%A _Clark Kimberling_

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.

Last modified June 13 17:44 EDT 2021. Contains 345008 sequences. (Running on oeis4.)