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 A023510 #12 Jul 20 2016 12:49:33
%S A023510 1,2,1,3,2,1,2,2,3,1,5,1,1,2,4,3,2,1,2,3,1,4,2,2,2,1,3,3,1,1,7,2,1,2,
%T A023510 2,3,1,2,3,1,2,1,6,1,2,3,2,5,2,1,2,4,2,2,1,3,3,4,1,1,2,2,2,3,1,1,2,2,
%U A023510 2,2,1,3,4,1,2,7,1,1,1,1,2,1,4,1,3,2,2,1,1,4,2,5,3,2,3,3,1,2,2
%N A023510 Greatest exponent in prime-power factorization of prime(n) + 1.
%C A023510 If a(n)=1 then prime(a(n)) is a term in A049097. - _Zak Seidov_, Jul 20 2016
%H A023510 Zak Seidov, <a href="/A023510/b023510.txt">Table of n, a(n) for n = 1..10000</a>
%F A023510 a(n) = A051903(A008864(n)). - _Michel Marcus_, Jul 20 2016
%e A023510 For n=5, the fifth prime is 11, and the prime factorization of 11 + 1 = 12 is 2^2*3. This has exponents 2 and 1, so a(5) is the largest of these exponents, 2. - _Michael B. Porter_, Jul 20 2016
%t A023510 Table[Max[#[[2]] & /@ FactorInteger[Prime[k] + 1]], {k, 10000}] (* _Zak Seidov_, Jul 19 2016 *)
%o A023510 (PARI) a(n) = vecmax(factor(prime(n)+1)[,2]) \\ _Michel Marcus_, Jul 20 2016
%Y A023510 Cf. A008864, A023509, A049097, A051903.
%K A023510 nonn
%O A023510 1,2
%A A023510 _Clark Kimberling_