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 A136151 #8 Jun 22 2018 11:33:29
%S A136151 6,12,14,18,20,24,38,44,48,54,62,68,72,74,80,98,104,108,152,158,164,
%T A136151 192,194,200,212,224,242,272,278,284,314,332,338,368,384,398,422,432,
%U A136151 458,464,488,500,524,542,548,578,608,614,632,648,662,674,692,734,752,758
%N A136151 Composites n with exactly two distinct prime divisors and of the form n=1+(any prime).
%H A136151 Harvey P. Dale, <a href="/A136151/b136151.txt">Table of n, a(n) for n = 1..1000</a>
%F A136151 A008864 INTERSECT A007774. - _R. J. Mathar_, Feb 01 2008
%p A136151 isA136151 := proc(n) if isprime(n-1) then if nops(numtheory[factorset](n)) =2 then true; else false ; fi ; else false ; fi ; end: for i from 1 to 200 do n := ithprime(i)+1 ; if isA136151( n) then printf("%d, ",n) ; fi ; od: # _R. J. Mathar_, Feb 01 2008
%t A136151 Select[Range[800],PrimeNu[#]==2&&PrimeQ[#-1]&] (* _Harvey P. Dale_, Jun 22 2018 *)
%Y A136151 Cf. A136152, A136153, A136154, A136155.
%K A136151 easy,nonn
%O A136151 1,1
%A A136151 _Enoch Haga_, Dec 16 2007
%E A136151 Edited by _R. J. Mathar_, Feb 01 2008