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 A049236 #21 Sep 16 2024 02:35:49
%S A049236 1,1,1,1,1,2,1,2,1,1,2,2,1,2,1,2,1,2,2,1,2,1,2,2,2,1,3,1,2,2,2,2,1,2,
%T A049236 1,2,2,3,1,2,1,2,1,3,1,2,2,2,1,3,2,1,1,2,2,2,1,3,2,1,3,2,2,1,3,2,2,2,
%U A049236 1,2,2,1,2,2,2,3,2,3,2,2,1,2,1,3,2,2,2,2,1,3,2,2,2,2,2,2,2,1,3,2,2,2,2,1,2
%N A049236 a(n) is the number of distinct prime factors of prime(n) + 2.
%H A049236 G. C. Greubel, <a href="/A049236/b049236.txt">Table of n, a(n) for n = 1..1000</a>
%F A049236 a(n) = A001221(A052147(n)). - _Amiram Eldar_, Sep 16 2024
%e A049236 prime(27) = 103, prime(27) + 2 = 105 = 3*5*7 has 3 prime factors, so a(27) = 3.
%t A049236 Table[Length[FactorInteger[Prime[n] + 2]], {n, 1, 50}] (* _G. C. Greubel_, May 12 2017 *)
%o A049236 (PARI) a(n) = omega(prime(n) + 2); \\ _Amiram Eldar_, Sep 16 2024
%Y A049236 Cf. A000040, A001221, A001359, A052147, A064909, A064910, A064911.
%K A049236 nonn,easy
%O A049236 1,6
%A A049236 _Labos Elemer_