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 A324657 #10 Mar 11 2019 20:48:07
%S A324657 0,0,1,1,1,2,2,0,3,4,2,0,5,0,2,1,1,3,3,2,5,0,3,0,1,2,1,4,0,0,2,0,2,1,
%T A324657 2,0,3,2,0,1,1,0,1,0,0,1,2,0,0,2,1,2,3,0,0,0,1,0,0,1,4,0,1,2,0,0,0,4,
%U A324657 1,1,1,0,1,2,1,1,1,3,2,1,2,1,1,0,2,1,0,1,0,0,2,4,2,1,0,0,3,0,4,1,3,0,0,1,0
%N A324657 a(n) is the number of successive primorials A002110(i) larger than prime(n) that need to be tried before sum prime(n)+A002110(i) is found to be composite.
%C A324657 See comments and examples in A324656.
%H A324657 Antti Karttunen, <a href="/A324657/b324657.txt">Table of n, a(n) for n = 1..25000</a>
%H A324657 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A324657 a(n) = A324656(A000040(n)).
%o A324657 (PARI)
%o A324657 A002110(n) = prod(i=1,n,prime(i));
%o A324657 A235224(n, p=2) = if(!n, n, 1+A235224(n\p, nextprime(p+1)));
%o A324657 A324656(n) = { my(k=0,b=A235224(n)); while(isprime(n+A002110(b+k)), k++); (k); };
%o A324657 A324657(n) = A324656(prime(n));
%Y A324657 Cf. A000040, A002110, A324656.
%K A324657 nonn
%O A324657 1,6
%A A324657 _Antti Karttunen_, Mar 11 2019