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!)
A245457 a(n) = ((prime(n)-1)!+2) mod prime(n)# (cf. A002110). 3

%I #12 Jul 24 2014 10:53:31

%S 1,4,26,92,2102,23102,60062,510512,29099072,3792578792,84106011992,

%T 2005604901302,252305096583542,11561510014033982,52331045326680122,

%U 31359378912013061912,1792403716245452460152,98060777857864844592572,3401363059422802158514832

%N a(n) = ((prime(n)-1)!+2) mod prime(n)# (cf. A002110).

%C Smallest positive residue modulo p_1*...*p_n (cf. A002110) of (p_n-1)!+2, where p_n=prime(n).

%C See comment in A245460.

%H Jens Kruse Andersen, <a href="/A245457/b245457.txt">Table of n, a(n) for n = 1..100</a>

%H V. Shevelev, <a href="http://arXiv.org/abs/0912.4006">Theorems on twin primes-dual case</a>, arXiv:0912.4006 (Sections 10,11,14-18)

%o (PARI) a(n) = ((prime(n)-1)!+2) % prod(i=1, n, prime(i)) \\ _Jens Kruse Andersen_, Jul 22 2014

%Y Cf. A002110, A244570, A244571, A244572.

%K nonn

%O 1,2

%A _Vladimir Shevelev_, Jul 22 2014

%E More terms and simpler definition from _Jens Kruse Andersen_, Jul 22 2014

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 April 23 19:56 EDT 2024. Contains 371916 sequences. (Running on oeis4.)