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 A321985 #7 Dec 08 2018 00:34:44 %S A321985 3,5,15,25,205,715,1095,1315,1615,2055,2405,2925,3755,4615,4795,5015, %T A321985 5055,5475,6785,7855,8115,8175,9425,9475,10415,10845,11025,11245, %U A321985 12335,12765,15225,16225,16395,16405,18145,18175,18275,21345,21915,22905,23165,23815 %N A321985 Numbers m such that m^2+1 is semiprime with (m-1)^2+1 and (m+1)^2+1 primes. %C A321985 Subsequence of A085722. %C A321985 For n>1, a(n) == 5 (mod 10). %C A321985 The corresponding pairs of primes (p, q) = ((m-1)^2+1, (m+1)^2+1) are congruent to 7 (mod 10), and the semiprimes are of the form m^2+1 = 2r where r is congruent to 3 (mod 10). So, a(n) = (q - 2r - 1)/2 = (2r - p + 1)/2 = (q - p)/4. %e A321985 15 is in the sequence because 15^2 + 1 = 2*113 is semiprime, and 14^2 + 1 = 197, 16^2 + 1 = 257 are prime numbers. %t A321985 Select[Range[50000],PrimeQ[(#-1)^2+1]&&PrimeOmega [#^2+1]==2&&PrimeQ[(#+1)^2+1]&] %o A321985 (PARI) isok(m) = (bigomega(m^2+1) == 2) && isprime((m-1)^2+1) && isprime((m+1)^2+1); \\ _Michel Marcus_, Nov 23 2018 %Y A321985 Cf. A005574, A085722, A321795. %K A321985 nonn %O A321985 1,1 %A A321985 _Michel Lagneau_, Nov 23 2018