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 A054758 #17 Nov 20 2017 03:30:40
%S A054758 1,1,1,1,2,1,2,3,2,8,5,4,1,6,3,13,7,2,1,6,2,3,5,7,7,8,31,1,22,6,60,20,
%T A054758 12,5,2,12,5,16,7,20,1,2,14,42,23,16,13,30,53,5,7,36,10,10,67,6,2,40,
%U A054758 24,3,28,59,6,4,76,1,74,5,30,16,2,39,6,56,138,3,22,37,11,8,35,102,156
%N A054758 a(n) is the smallest multiplier w such that A002110(n)*w + prime(n+1)^2 is prime.
%C A054758 For n=1,2,3,4,6,13,19,28,41,66,85,..., A002110(n) + prime(n+1)^2 is a prime; i.e., the multiplier w is 1.
%H A054758 Michael De Vlieger, <a href="/A054758/b054758.txt">Table of n, a(n) for n = 1..500</a>
%e A054758 2310 + 169 = 2479 = 37*67 = 2*3*5*7*11 + 13^2 is not prime but 2*2310 + 169 = 4789 is a prime.
%t A054758 Table[Function[{P, q}, w = 1; While[! PrimeQ[P w + q], w++]; w] @@ {Times @@ #2, First[#1]^2} & @@ # &@ TakeDrop[Take[#, n], -1], {n, 2, Length@ #}] &@ Prime@ Range@ 84 (* _Michael De Vlieger_, Jul 14 2017 *)
%o A054758 (PARI) a(n) = {my(m=1, primo=prod(k=1, n, prime(k))); while (!isprime(primo*m + prime(n+1)^2), m++); m;} \\ _Michel Marcus_, Nov 20 2017
%Y A054758 Cf. A002110.
%K A054758 nonn
%O A054758 1,5
%A A054758 _Labos Elemer_, Apr 25 2000