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-6 of 6 results.

A103572 Sum of the (primes > 5 modulo 19).

Original entry on oeis.org

7, 18, 31, 48, 48, 52, 62, 74, 92, 95, 100, 109, 124, 126, 130, 140, 154, 170, 173, 180, 193, 195, 201, 209, 221, 235, 253, 266, 283, 287, 293, 309, 327, 332, 343, 358, 360, 368, 378, 379, 382, 389, 398, 400, 414, 432, 433, 438, 449, 462, 466, 476, 492, 495
Offset: 1

Views

Author

Roger L. Bagula, Mar 23 2005

Keywords

Comments

Case q=19 of a(n,q) = Sum_{i=1..n} (prime(i+3) mod q).

Crossrefs

Cf. A033633, A103566-A103571.

Programs

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

Formula

a(n+1)-a(n) = A033633(n+4).

A103567 Sum of the (primes > 5 modulo 5).

Original entry on oeis.org

2, 3, 6, 8, 12, 15, 19, 20, 22, 23, 26, 28, 31, 35, 36, 38, 39, 42, 46, 49, 53, 55, 56, 59, 61, 65, 68, 70, 71, 73, 77, 81, 82, 84, 87, 89, 92, 96, 97, 98, 101, 103, 107, 108, 111, 113, 117, 120, 124, 125, 126, 128, 131, 135, 136, 138, 139, 142, 145, 147, 148, 151, 153
Offset: 1

Views

Author

Roger L. Bagula, Mar 23 2005

Keywords

Links

Crossrefs

Cf. A039703, A103566, A103568-A103572.

Programs

  • Mathematica
    a = Table[Sum[Mod[Prime[i + 3], 5], {i, 1, n}], {n, 1, 200}]
Accumulate[Mod[#,5]&/@Prime[Range[4,70]]] (* Harvey P. Dale, May 31 2014 *)

Formula

a(n+1)-a(n) = A039703(n+4).

A103568 Sum of the (primes > 5 modulo 7).

Original entry on oeis.org

0, 4, 10, 13, 18, 20, 21, 24, 26, 32, 33, 38, 42, 45, 50, 54, 55, 58, 60, 66, 71, 77, 80, 85, 87, 91, 92, 93, 98, 102, 108, 110, 114, 117, 119, 125, 130, 134, 140, 142, 146, 147, 150, 151, 157, 160, 165, 167, 168, 171, 177, 182, 186, 189, 194, 198, 199, 202, 208, 214
Offset: 1

Views

Author

Roger L. Bagula, Mar 23 2005

Keywords

Crossrefs

Cf. A039705, A103566-A103567, A103569-A103572.

Programs

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

Formula

a(n+1)-a(n) = A039705(n+4).

A103569 Sum of the (primes > 5 modulo 11).

Original entry on oeis.org

7, 7, 9, 15, 23, 24, 31, 40, 44, 52, 62, 65, 74, 78, 84, 85, 90, 97, 99, 105, 106, 115, 117, 121, 129, 139, 142, 148, 158, 163, 170, 176, 184, 187, 196, 198, 206, 209, 214, 218, 224, 234, 235, 237, 240, 247, 256, 258, 266, 276, 285, 289, 299, 304, 311, 313, 319
Offset: 1

Views

Author

Roger L. Bagula, Mar 23 2005

Keywords

Crossrefs

Cf. A039709, A103566-A103568, A103570-A103572.

Programs

  • Mathematica
    a = Table[Sum[Mod[Prime[i + 3], 11], {i, 1, n}], {n, 1, 200}]
Accumulate[Mod[Prime[Range[4,60]],11]] (* Harvey P. Dale, Aug 24 2017 *)

Formula

a(n+1)-a(n) = A039709(n+4).

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

Cf. A039711, A103566-A103569, A103571-A103572.

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).

A103571 Sum of the (primes > 5 modulo 17).

Original entry on oeis.org

7, 18, 31, 31, 33, 39, 51, 65, 68, 75, 84, 97, 99, 107, 117, 133, 136, 141, 152, 167, 171, 183, 199, 200, 205, 212, 223, 231, 243, 244, 247, 260, 275, 279, 289, 303, 306, 315, 326, 330, 336, 346, 358, 365, 367, 373, 381, 393, 394, 397, 410, 412, 420, 434, 450
Offset: 1

Views

Author

Roger L. Bagula, Mar 23 2005

Keywords

Crossrefs

Cf. A039715, A103566-A103570, A103572.

Programs

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

Formula

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.