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.

Showing 1-4 of 4 results.

A242119 Primes modulo 18.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 1, 5, 11, 13, 1, 5, 7, 11, 17, 5, 7, 13, 17, 1, 7, 11, 17, 7, 11, 13, 17, 1, 5, 1, 5, 11, 13, 5, 7, 13, 1, 5, 11, 17, 1, 11, 13, 17, 1, 13, 7, 11, 13, 17, 5, 7, 17, 5, 11, 17, 1, 7, 11, 13, 5, 1, 5, 7, 11, 7, 13, 5, 7, 11, 17, 7, 13, 1, 5
Offset: 1

Views

Author

Vincenzo Librandi, May 05 2014

Keywords

Crossrefs

Cf. sequences of the type Primes mod k: A039701 (k=3), A039702 (k=4), A039703 (k=5), A039704 (k=6), A039705 (k=7), A039706 (k=8), A038194 (k=9), A007652 (k=10), A039709 (k=11), A039710 (k=12), A039711 (k=13), A039712 (k=14), A039713 (k=15), A039714 (k=16), A039715 (k=17), this sequence (k=18), A033633 (k=19), A242120(k=20), A242121 (k=21), A242122 (k=22), A229786 (k=23), A229787 (k=24), A242123 (k=25), A242124 (k=26), A242125 (k=27), A242126 (k=28), A242127 (k=29), A095959 (k=30), A110923 (k=100).

Programs

  • Magma
    [p mod(18): p in PrimesUpTo(500)];
    
  • Mathematica
    Mod[Prime[Range[100]], 18]
  • Sage
    [mod(p, 18) for p in primes(500)] # Bruno Berselli, May 05 2014

Formula

Sum_{i=1..n} a(i) ~ 9n. The derivation is the same as in the formula in A039715. - Jerzy R Borysowicz, Apr 27 2022

A039710 a(n) = n-th prime modulo 12.

Original entry on oeis.org

2, 3, 5, 7, 11, 1, 5, 7, 11, 5, 7, 1, 5, 7, 11, 5, 11, 1, 7, 11, 1, 7, 11, 5, 1, 5, 7, 11, 1, 5, 7, 11, 5, 7, 5, 7, 1, 7, 11, 5, 11, 1, 11, 1, 5, 7, 7, 7, 11, 1, 5, 11, 1, 11, 5, 11, 5, 7, 1, 5, 7, 5, 7, 11, 1, 5, 7, 1, 11, 1, 5, 11, 7, 1, 7, 11, 5, 1, 5, 1, 11
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

Formula

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

A039712 a(n) = n-th prime modulo 14.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 3, 5, 9, 1, 3, 9, 13, 1, 5, 11, 3, 5, 11, 1, 3, 9, 13, 5, 13, 3, 5, 9, 11, 1, 1, 5, 11, 13, 9, 11, 3, 9, 13, 5, 11, 13, 9, 11, 1, 3, 1, 13, 3, 5, 9, 1, 3, 13, 5, 11, 3, 5, 11, 1, 3, 13, 13, 3, 5, 9, 9, 1, 11, 13, 3, 9, 3, 9, 1, 5, 11, 5, 9
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

Formula

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

A103570 Sum of the (primes > 5 modulo 13).

Original entry on oeis.org

7, 18, 18, 22, 28, 38, 41, 46, 57, 59, 63, 71, 72, 79, 88, 90, 96, 104, 105, 110, 121, 127, 137, 149, 152, 157, 166, 176, 177, 184, 193, 199, 207, 208, 215, 226, 230, 240, 252, 261, 272, 274, 278, 281, 283, 289, 297, 309, 314, 321, 325, 335, 338, 347, 358, 362
Offset: 1

Views

Author

Roger L. Bagula, Mar 23 2005

Keywords

Crossrefs

Programs

  • Mathematica
    a = Table[Sum[Mod[Prime[i + 3], 13], {i, 1, n}], {n, 1, 200}]

Formula

a(n+1)-a(n) = A039711(n+4).
Showing 1-4 of 4 results.