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 A268185 #19 Sep 08 2022 08:46:15
%S A268185 4,6,10,14,12,16,24,28,26,38,32,44,42,46,54,56,68,62,74,72,76,88,86,
%T A268185 98,104,102,106,114,118,116,134,132,144,148,158,152,164,166,174,176,
%U A268185 188,182,192,196,204,208,212,226,234,238,236,248,242,252,264
%N A268185 a(n) = prime(n) + last digit of prime(n).
%C A268185 All terms are even.
%F A268185 a(n) = prime(n) + (prime(n) mod 10).
%F A268185 a(n) = A000040(n) + A007652(n).
%e A268185 For the prime 19, we have: 19 + (19 modulo 10) = 28.
%t A268185 Table[Prime[n] + Mod[Prime[n], 10], {n, 100}] (* _Alonso del Arte_, Jan 28 2016 *)
%o A268185 (PARI) a(n) = prime(n) + prime(n) % 10; \\ _Michel Marcus_, Jan 28 2016
%o A268185 (PARI) lista(nn) = {forprime(p=2, nn, print1(p + p % 10, ", "));} \\ _Altug Alkan_, Feb 04 2016
%o A268185 (Magma) [NthPrime(n) + (NthPrime(n) mod 10): n in [1..60]]; // _Vincenzo Librandi_, Jan 31 2016
%Y A268185 Cf. A000040, A007652.
%K A268185 nonn,easy,base
%O A268185 1,1
%A A268185 _Emre APARI_, Jan 28 2016