login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268185 a(n) = prime(n) + last digit of prime(n). 0

%I #19 Sep 08 2022 08:46:15

%S 4,6,10,14,12,16,24,28,26,38,32,44,42,46,54,56,68,62,74,72,76,88,86,

%T 98,104,102,106,114,118,116,134,132,144,148,158,152,164,166,174,176,

%U 188,182,192,196,204,208,212,226,234,238,236,248,242,252,264

%N a(n) = prime(n) + last digit of prime(n).

%C All terms are even.

%F a(n) = prime(n) + (prime(n) mod 10).

%F a(n) = A000040(n) + A007652(n).

%e For the prime 19, we have: 19 + (19 modulo 10) = 28.

%t Table[Prime[n] + Mod[Prime[n], 10], {n, 100}] (* _Alonso del Arte_, Jan 28 2016 *)

%o (PARI) a(n) = prime(n) + prime(n) % 10; \\ _Michel Marcus_, Jan 28 2016

%o (PARI) lista(nn) = {forprime(p=2, nn, print1(p + p % 10, ", "));} \\ _Altug Alkan_, Feb 04 2016

%o (Magma) [NthPrime(n) + (NthPrime(n) mod 10): n in [1..60]]; // _Vincenzo Librandi_, Jan 31 2016

%Y Cf. A000040, A007652.

%K nonn,easy,base

%O 1,1

%A _Emre APARI_, Jan 28 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 22:52 EDT 2024. Contains 375353 sequences. (Running on oeis4.)