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 A049234 #21 Feb 16 2025 05:39:40
%S A049234 3,2,2,3,2,4,2,4,3,2,4,4,2,6,3,4,2,6,4,2,6,5,4,4,6,2,8,2,4,4,4,4,2,4,
%T A049234 2,6,4,8,3,6,2,4,2,8,2,4,4,9,2,8,4,2,6,4,4,4,2,8,6,2,8,4,4,2,12,4,6,4,
%U A049234 2,8,4,3,6,8,4,8,4,8,4,4,2,6,2,8,9,4,4,8,2,8,4,4,4,4,4,4,4,2,12,4,6,4,4
%N A049234 Number of divisors of prime(n) + 2.
%H A049234 Amiram Eldar, <a href="/A049234/b049234.txt">Table of n, a(n) for n = 1..10000</a>
%F A049234 a(n) = A000005(A052147(n)). - _Amiram Eldar_, Feb 16 2025
%e A049234 a(10) = d(prime(10)+2) = d(29+2) = d(29) = 2.
%t A049234 Table[DivisorSigma[0,Prime[n]+2],{n,1,103}]
%o A049234 (PARI) a(n) = numdiv(prime(n)+2); \\ _Michel Marcus_, Dec 15 2013
%Y A049234 Cf. A000005, A052147.
%K A049234 nonn,easy
%O A049234 1,1
%A A049234 _Labos Elemer_