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 A268465 #13 May 17 2022 16:09:02 %S A268465 23,349,1579,4691,5783,7187,9547,11519,15377,45779,52289,353359, %T A268465 361787,384277,510227,678413,710599,1007861,1218709,1301617,1484449, %U A268465 1567567,1839469,2073989,2264959,2409163,2438377,2520779,2735281,2882653,2998867,3100271,3211751 %N A268465 Primes of the form m*prime(m) + (m + 1)*prime(m + 1) + (m + 2)*prime(m + 2). %C A268465 Primes arising in A105455. %C A268465 Primes of the form A033286(m)+A033286(m+1)+A033286(m+2). %H A268465 Michael S. Branicky, <a href="/A268465/b268465.txt">Table of n, a(n) for n = 1..10000</a> %o A268465 (Python) %o A268465 from itertools import islice %o A268465 from sympy import isprime, nextprime %o A268465 def agen(): # generator of terms %o A268465 m, p, q, r = 1, 2, 3, 5 %o A268465 while True: %o A268465 t = m*p + (m+1)*q + (m+2)*r %o A268465 if isprime(t): yield t %o A268465 m, p, q, r = m+1, q, r, nextprime(r) %o A268465 print(list(islice(agen(), 33))) # _Michael S. Branicky_, May 17 2022 %Y A268465 Cf. A033286. %K A268465 nonn %O A268465 1,1 %A A268465 _Zak Seidov_, Feb 05 2016 %E A268465 Typo in a(28) fixed by _Seth A. Troisi_, May 17 2022 %E A268465 a(29) and beyond from _Michael S. Branicky_, May 17 2022