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!)
A004649 a(n) = prime(n) mod (n-1). 8

%I #25 Oct 26 2023 08:33:21

%S 0,1,1,3,3,5,5,7,2,1,4,5,4,5,8,11,10,13,14,13,16,17,20,1,1,25,26,25,

%T 26,7,7,9,7,13,11,13,15,15,17,19,17,23,21,21,19,27,35,35,33,33,35,33,

%U 39,41,43,45,43,45,45,43,49,59,59,57,57,1,2,7,4,3,4,7,8

%N a(n) = prime(n) mod (n-1).

%H Vincenzo Librandi, <a href="/A004649/b004649.txt">Table of n, a(n) for n = 2..1000</a>

%t Table[Mod[Prime[n], n - 1], {n, 2, 100}] (* _Vincenzo Librandi_, Sep 11 2014 *)

%o (PARI) a(n) = prime(n) % (n-1) \\ _Michel Marcus_, Jun 12 2013

%o (Magma) [NthPrime(n) mod (n-1): n in [2..90]]; // _Vincenzo Librandi_, Sep 11 2014

%Y Cf. A004648, A004650.

%K nonn,easy

%O 2,4

%A _N. J. A. Sloane_, Daniel Wild (wild(AT)edumath.u-strasbg.fr)

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 August 18 16:43 EDT 2024. Contains 375269 sequences. (Running on oeis4.)