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
1, 4, 26, 92, 2102, 23102, 60062, 510512, 29099072, 3792578792, 84106011992, 2005604901302, 252305096583542, 11561510014033982, 52331045326680122, 31359378912013061912, 1792403716245452460152, 98060777857864844592572, 3401363059422802158514832 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Smallest positive residue modulo p_1*...*p_n (cf. A002110) of (p_n-1)!+2, where p_n=prime(n).
See comment in A245460.
LINKS
Jens Kruse Andersen, Table of n, a(n) for n = 1..100
V. Shevelev, Theorems on twin primes-dual case, arXiv:0912.4006 (Sections 10,11,14-18)
PROG
(PARI) a(n) = ((prime(n)-1)!+2) % prod(i=1, n, prime(i)) \\ Jens Kruse Andersen, Jul 22 2014
CROSSREFS
Sequence in context: A172123 A298190 A299084 * A299340 A299847 A118285
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Jul 22 2014
EXTENSIONS
More terms and simpler definition from Jens Kruse Andersen, Jul 22 2014
STATUS
approved

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 19 08:20 EDT 2024. Contains 371782 sequences. (Running on oeis4.)