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.

A095959 a(n) = n-th prime modulo 30.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 1, 7, 11, 13, 17, 23, 29, 1, 7, 11, 13, 19, 23, 29, 7, 11, 13, 17, 19, 23, 7, 11, 17, 19, 29, 1, 7, 13, 17, 23, 29, 1, 11, 13, 17, 19, 1, 13, 17, 19, 23, 29, 1, 11, 17, 23, 29, 1, 7, 11, 13, 23, 7, 11, 13, 17, 1, 7, 17, 19, 23, 29, 7, 13, 19
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 14 2004

Keywords

Comments

A002110(3) = 2*3*5 = 30; range for n>3: {1,7,11,13,17,19,23,29} of size 8 = A000720(30) - #{2,3,5} + #{1} = 10 - 3 + 1 = A000010(30).

Crossrefs

Cf. similar sequences listed in A242119.

Programs

Formula

Sum_k={1..n} a(k) ~ 15*n. - Amiram Eldar, Dec 13 2024