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 A288815 #13 Aug 03 2017 05:02:43 %S A288815 2,6,18,30,66,150,192,258,366,450,570,708,894,1044,1284,1422,1656, %T A288815 1902,2190,2460,2622 %N A288815 Paired Jacobsthal function applied to the product of the first n primes. %C A288815 There is a conjecture about an upper bound on this sequence. Let p_n be the n-th prime. If a(n) < p_n^2 - p_n holds for n>=3 then Goldbach's conjecture and the twin prime conjecture hold as well. %H A288815 Mario Ziller, John F. Morack, <a href="https://arxiv.org/abs/1706.00317">Divisibility in paired progressions, Goldbach's conjecture, and the infinitude of prime pairs</a>, arXiv:1706.00317 [math.NT], 2017. %H A288815 Mario Ziller, John F. Morack, <a href="https://arxiv.org/src/1706.03668v1/anc/full_details.pdf">On the computation of the generalised Jacobsthal function for paired progressions</a>, arXiv:1706.03668 [math.NT], 2017. %F A288815 a(n) = 6*A072753(n) + 6, for n>=3. %Y A288815 Cf. A072753, A048670. %K A288815 hard,more,nonn %O A288815 1,1 %A A288815 _Mario Ziller_, Jun 17 2017