cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A245457 #12 Jul 24 2014 10:53:31
%S A245457 1,4,26,92,2102,23102,60062,510512,29099072,3792578792,84106011992,
%T A245457 2005604901302,252305096583542,11561510014033982,52331045326680122,
%U A245457 31359378912013061912,1792403716245452460152,98060777857864844592572,3401363059422802158514832
%N A245457 a(n) = ((prime(n)-1)!+2) mod prime(n)# (cf. A002110).
%C A245457 Smallest positive residue modulo p_1*...*p_n (cf. A002110) of (p_n-1)!+2, where p_n=prime(n).
%C A245457 See comment in A245460.
%H A245457 Jens Kruse Andersen, <a href="/A245457/b245457.txt">Table of n, a(n) for n = 1..100</a>
%H A245457 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 A245457 (PARI) a(n) = ((prime(n)-1)!+2) % prod(i=1, n, prime(i)) \\ _Jens Kruse Andersen_, Jul 22 2014
%Y A245457 Cf. A002110, A244570, A244571, A244572.
%K A245457 nonn
%O A245457 1,2
%A A245457 _Vladimir Shevelev_, Jul 22 2014
%E A245457 More terms and simpler definition from _Jens Kruse Andersen_, Jul 22 2014