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 A113150 #32 Feb 16 2025 08:32:59
%S A113150 838561,1190821,2116921,3318421,3456721,3720361,3776881,4185121,
%T A113150 5712241,5811241,6455521,6457621,6793321,7450501,7981801,8321881,
%U A113150 8391001,9903721,11420041,11980921,12806041,13311301,13748521,14326021,14566261
%N A113150 Primes p such that p+1, p+2, p+3, p+4, p+5 are resp. 2-, 3-, 4-, 5-, 6-almost primes.
%C A113150 All terms == 1 (mod 12).
%H A113150 Zak Seidov, <a href="/A113150/b113150.txt">Table of n, a(n) for n = 1..2000</a>
%H A113150 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AlmostPrime.html">Almost Prime</a>.
%t A113150 Select[Prime[Range[10^6]], PrimeOmega[#+1]==2 && PrimeOmega[#+2]==3 && PrimeOmega[#+3]==4 && PrimeOmega[#+4]==5 && PrimeOmega[#+5]==6&] (* _James C. McMahon_, Jun 16 2024 *)
%o A113150 (Magma) [ n: n in PrimesUpTo(15000000) | forall{ k: k in [1..5] | &+[ f[j, 2]: j in [1..#f] ] eq k+1 where f is Factorization(n+k) } ]; // _Klaus Brockhaus_, Jan 24 2011
%o A113150 (PARI) isok(n) = bigomega(n)==1 && bigomega(n+1)==2 && bigomega(n+2)==3 && bigomega(n+3)==4 && bigomega(n+4)==5 && bigomega(n+5)==6; \\ _Michel Marcus_, Oct 23 2014
%Y A113150 Cf. A005383, A112998, A113000, A113008.
%K A113150 nonn
%O A113150 1,1
%A A113150 _Zak Seidov_, Jan 04 2006
%E A113150 Edited by _Charles R Greathouse IV_, Apr 20 2010