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 A065073 #27 Dec 05 2024 14:45:34
%S A065073 4,6,10,14,13,17,25,29,28,40,35,47,46,50,58,61,73,68,80,79,83,95,94,
%T A065073 106,113,103,107,115,119,118,137,136,148,152,163,158,170,173,181,184,
%U A065073 196,191,202,206,214,218,215,230,238,242,241,253,248,259,271,274,286
%N A065073 a(n) = prime(n) + (sum of digits of prime(n)).
%H A065073 Harry J. Smith, <a href="/A065073/b065073.txt">Table of n, a(n) for n = 1..1000</a>
%F A065073 a(n) = A062028(A000040(n)). - _M. F. Hasler_, Nov 06 2018
%e A065073 a(5) = 13 because p(5) = 11 and 11 + (1 + 1) = 13.
%t A065073 Table[ Prime[n] + Apply[ Plus, IntegerDigits[ Prime[n]]], {n, 1, 75} ]
%o A065073 (PARI) forprime(p=2,300,print1(p+sumdigits(p),",")) \\ Edited by _M. F. Hasler_, Nov 06 2018
%o A065073 (PARI) A065073(n)=sumdigits(n=prime(n))+n \\ _M. F. Hasler_, Nov 06 2018
%o A065073 (Haskell) a065073 = a062028 . a000040 -- _Reinhard Zumkeller_, Sep 27 2014
%o A065073 (Magma) [NthPrime(n) + &+Intseq(NthPrime(n), 10): n in [1..80]]; // _Vincenzo Librandi_, Nov 07 2018
%Y A065073 Cf. A062028, A007953, A000040.
%Y A065073 Cf. A047791, A048519, A048520, A006378, A107740.
%K A065073 nonn,base,easy
%O A065073 1,1
%A A065073 _Bodo Zinser_, Nov 09 2001
%E A065073 More terms from Larry Reeves (larryr(AT)acm.org) and _Robert G. Wilson v_, Nov 13 2001