cp's OEIS Frontend

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.

A268185 a(n) = prime(n) + last digit of prime(n).

Original entry on oeis.org

4, 6, 10, 14, 12, 16, 24, 28, 26, 38, 32, 44, 42, 46, 54, 56, 68, 62, 74, 72, 76, 88, 86, 98, 104, 102, 106, 114, 118, 116, 134, 132, 144, 148, 158, 152, 164, 166, 174, 176, 188, 182, 192, 196, 204, 208, 212, 226, 234, 238, 236, 248, 242, 252, 264
Offset: 1

Views

Author

Emre APARI, Jan 28 2016

Keywords

Comments

All terms are even.

Examples

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

Crossrefs

Programs

  • Magma
    [NthPrime(n) + (NthPrime(n) mod 10): n in [1..60]]; // Vincenzo Librandi, Jan 31 2016
  • Mathematica
    Table[Prime[n] + Mod[Prime[n], 10], {n, 100}] (* Alonso del Arte, Jan 28 2016 *)
  • PARI
    a(n) = prime(n) + prime(n) % 10; \\ Michel Marcus, Jan 28 2016
    
  • PARI
    lista(nn) = {forprime(p=2, nn, print1(p + p % 10, ", "));} \\ Altug Alkan, Feb 04 2016
    

Formula

a(n) = prime(n) + (prime(n) mod 10).
a(n) = A000040(n) + A007652(n).