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 A023581 #11 Sep 08 2022 08:44:47
%S A023581 1,2,3,2,2,4,3,2,2,5,2,4,3,2,3,4,2,6,3,2,3,2,2,3,4,4,2,3,5,3,3,2,4,2,
%T A023581 4,3,6,2,3,5,3,4,2,4,5,2,2,2,3,4,3,3,3,2,4,3,5,2,5,3,3,4,3,2,3,7,2,4,
%U A023581 4,6,3,2,3,4,2,2,5,6,3,3,2,4,3,3,3,2,3,4,5,2,3,2,4,3,2,3,9,3,2
%N A023581 Sum of exponents in prime-power factorization of p(n)+3.
%H A023581 G. C. Greubel, <a href="/A023581/b023581.txt">Table of n, a(n) for n = 1..10000</a>
%F A023581 a(n) = A001222(A113935(n)). - _Michel Marcus_, Sep 30 2013
%t A023581 Table[PrimeOmega[3 + Prime[n]], {n, 1, 100}] (* _G. C. Greubel_, May 21 2019 *)
%o A023581 (PARI) a(n) = bigomega(prime(n) + 3); \\ _Michel Marcus_, Sep 30 2013
%o A023581 (Magma) [n eq 1 select 1 else (&+[p[2]: p in Factorization(NthPrime(n) + 3)]): n in [1..100]]; // _G. C. Greubel_, May 21 2019
%o A023581 (Sage) [sloane.A001222(nth_prime(n)+3) for n in (1..100)] # _G. C. Greubel_, May 21 2019
%K A023581 nonn
%O A023581 1,2
%A A023581 _Clark Kimberling_