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.

A253936 a(n) = prime(n + (prime(n) mod 10)).

Original entry on oeis.org

5, 11, 19, 31, 13, 23, 43, 59, 37, 67, 37, 67, 43, 59, 79, 67, 101, 67, 101, 73, 89, 127, 101, 137, 131, 103, 113, 149, 163, 137, 163, 137, 173, 191, 193, 157, 193, 179, 199, 191, 229, 191, 193, 211, 239, 257, 223, 233, 263, 277, 251, 283, 251, 257, 293, 277, 317, 277, 317, 283, 311, 313, 349, 313, 337, 367, 337, 379, 383
Offset: 1

Views

Author

Zak Seidov, Jan 23 2015

Keywords

Examples

			n=1: p=prime(1)=2; p mod 10 = 2, prime(1+2) = 5 = a(1);
n=6: p=prime(6)=13; p mod 10 = 3, prime(6+3) = 23 = a(6).
		

Crossrefs

Programs

  • Mathematica
    Table[Prime[n+Mod[Prime[n],10]],{n,100}]
  • PARI
    a(n)=prime(n+prime(n)%10)

Formula

a(n) = A000040(n + A010879(A000040(n))),
a(n) = A000040(n + A007652(n)).