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 A098145 #9 Aug 26 2015 23:32:36
%S A098145 4,6,12,22,67,114,314,509,1278,4594,6873,21674,44624,63304,124801,
%T A098145 329984,831879,1121566,2679756,4697276,6185762,13848729,23338552,
%U A098145 49996014,133231027,214481227,271249053,431149496,541946349,851376741
%N A098145 p + P(p) where p is the n-th prime and P(p) is the unrestricted partition number of p.
%F A098145 a(n) = A000040(n) + A000041(A000040(n)).
%e A098145 If p=17, P(p) = 297 and 17 + 297 = 314.
%p A098145 a:= n-> (p-> p+combinat[numbpart](p))(ithprime(n)):
%p A098145 seq(a(n), n=1..30); # _Alois P. Heinz_, Aug 26 2015
%t A098145 Table[Prime[n] + PartitionsP[Prime[n]], {n, 1, 50}] (* _Stefan Steinerberger_, Feb 28 2006 *)
%Y A098145 Cf. A000040, A000041.
%K A098145 nonn
%O A098145 1,1
%A A098145 _Parthasarathy Nambi_, Sep 28 2004
%E A098145 More terms from _Stefan Steinerberger_, Feb 28 2006