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.
%I A245458 #16 Dec 15 2018 08:34:59
%S A245458 1,3,8,122,212,6932,450452,9189182,193993802,2677114442,116454478142,
%T A245458 5415133233512,51945166943672,1521251317636052,562558737261811292,
%U A245458 1229779565176982822,130356633908760178922,19227603501542126390702,4456958491657464897364262
%N A245458 a(n) = ((prime(n)-2)!+2) mod prime(n)# (cf. A002110).
%C A245458 Smallest positive residue modulo p_1*...*p_n (cf. A002110) of (p_n-2)!+2, where p_n=prime(n).
%C A245458 See comment in A245460.
%H A245458 Jens Kruse Andersen, <a href="/A245458/b245458.txt">Table of n, a(n) for n = 1..100</a>
%H A245458 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)
%t A245458 a[n_] := Mod[(Prime[n]-2)! + 2, Product[Prime[i], {i, 1, n}]];
%t A245458 Array[a, 19] (* _Jean-François Alcover_, Dec 15 2018 *)
%o A245458 (PARI) a(n) = ((prime(n)-2)!+2) % prod(i=1, n, prime(i)) \\ _Jens Kruse Andersen_, Jul 22 2014
%Y A245458 Cf. A002110, A245457, A244570, A244571, A244572.
%K A245458 nonn
%O A245458 1,2
%A A245458 _Vladimir Shevelev_, Jul 22 2014
%E A245458 More terms and simpler definition from _Jens Kruse Andersen_, Jul 22 2014