The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A245458 a(n) = ((prime(n)-2)!+2) mod prime(n)# (cf. A002110). 2
1, 3, 8, 122, 212, 6932, 450452, 9189182, 193993802, 2677114442, 116454478142, 5415133233512, 51945166943672, 1521251317636052, 562558737261811292, 1229779565176982822, 130356633908760178922, 19227603501542126390702, 4456958491657464897364262 (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-2)!+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)
MATHEMATICA
a[n_] := Mod[(Prime[n]-2)! + 2, Product[Prime[i], {i, 1, n}]];
Array[a, 19] (* Jean-François Alcover, Dec 15 2018 *)
PROG
(PARI) a(n) = ((prime(n)-2)!+2) % prod(i=1, n, prime(i)) \\ Jens Kruse Andersen, Jul 22 2014
CROSSREFS
Sequence in context: A195568 A051047 A192629 * A036504 A227831 A132491
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 May 28 16:19 EDT 2024. Contains 372916 sequences. (Running on oeis4.)