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!)
A340781 a(n) = (n - 1)*prime(n + 1) mod prime(n). 1

%I #17 Jun 27 2021 04:50:36

%S 0,2,4,5,8,7,12,9,2,18,29,7,24,9,37,37,32,41,5,38,47,5,49,6,96,50,1,

%T 54,3,67,120,55,64,52,68,59,59,148,61,61,80,48,84,172,88,142,130,188,

%U 96,196,67,102,38,67,67,67,112,71,232,118,34,268,248,126,256,276

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

%H Stefano Spezia, <a href="/A340781/b340781.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A306192(n) mod A000040(n).

%t Table[Mod[(n-1)Prime[n+1],Prime[n]],{n,66}]

%o (PARI) a(n) = ((n-1)*prime(n+1)) % prime(n); \\ _Michel Marcus_, Jan 21 2021

%Y Cf. A000040, A033286, A306192, A340128, A340649.

%K nonn,look

%O 1,2

%A _Stefano Spezia_, Jan 21 2021

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 September 12 05:07 EDT 2024. Contains 375842 sequences. (Running on oeis4.)