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 A136155 #16 Feb 04 2023 05:30:04
%S A136155 6,12,14,18,20,24,30,38,42,44,48,54,60,62,68,72,74,80,84,90,98,102,
%T A136155 104,108,110,114,132,138,140,150,152,158,164,168,174,180,182,192,194,
%U A136155 198,200,212,224,228,230,234,240,242,252,258,264,270,272,278,282,284,294
%N A136155 Composites one larger than a prime and with exactly two or three distinct prime factors.
%H A136155 Robert Israel, <a href="/A136155/b136155.txt">Table of n, a(n) for n = 1..10000</a>
%F A136155 Union of A136151 and A136152. Subset of A008864. - _R. J. Mathar_, Apr 24 2008
%F A136155 A136151 UNION A136152. - _R. J. Mathar_, May 03 2008
%e A136155 a(1)=6, which is one larger than the prime 5 and has 2 distinct prime factors (namely 2 and 3).
%e A136155 60 is in the sequence because 59 is prime and 60 = 2^2*3*5 has three distinct prime factors.
%p A136155 A001221 := proc(n) nops(numtheory[factorset](n)) ; end: isA136155 := proc(n) if isprime(n-1) then RETURN( A001221(n)=2 or A001221(n)= 3) ; else RETURN(false) ; fi ; end: for n from 1 to 300 do if isA136155(n) then printf("%d,",n) ; fi ; od: # _R. J. Mathar_, May 03 2008
%t A136155 okQ[n_] := PrimeQ[n-1] && (PrimeNu[n]==2 || PrimeNu[n]==3);
%t A136155 Select[Range[6, 300, 2], okQ] (* _Jean-François Alcover_, Feb 04 2023 *)
%Y A136155 Cf. A136151, A136152, A136153, A136154.
%K A136155 easy,nonn
%O A136155 1,1
%A A136155 _Enoch Haga_, Dec 16 2007
%E A136155 Edited by _R. J. Mathar_ and _Jens Kruse Andersen_, Apr 24 2008