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

A348193 (Number of primes == 3 mod 4 less than n^2) - (number of primes == 1 mod 4 less than n^2).

Original entry on oeis.org

0, 1, 1, 1, 2, 2, 2, 1, 3, 2, 1, 3, 4, 3, 5, 5, 4, 3, 3, 3, 2, 3, 6, 6, 5, 5, 6, 4, 5, 5, 5, 5, 6, 4, 3, 3, 4, 3, 7, 12, 10, 7, 10, 8, 9, 10, 10, 7, 6, 6, 9, 8, 6, 6, 9, 6, 4, 9, 6, 8, 8, 7, 12, 11, 11, 9, 8, 9, 12, 9, 12, 17, 12, 13, 16, 12, 16, 18, 16, 15, 12, 12, 11, 17, 18, 14, 11, 13, 9, 5, 7, 7, 6, 7, 8, 7, 6, 8, 7, 10
Offset: 1

Views

Author

Seiichi Manyama, Oct 06 2021

Keywords

Comments

a(790) = -1.

Crossrefs

Programs

  • PARI
    a(n) = sum(k=2, n^2-1, (isprime(k)&&k%4==3)-(isprime(k)&&k%4==1));

Formula

a(n) = A348195(n) - A348196(n).

A348196 Number of primes of the form 4k+1 < n^2.

Original entry on oeis.org

0, 0, 1, 2, 3, 4, 6, 8, 9, 11, 14, 15, 17, 20, 21, 24, 28, 31, 34, 37, 41, 44, 46, 49, 54, 58, 61, 66, 70, 74, 78, 83, 87, 93, 98, 103, 107, 112, 116, 119, 126, 133, 136, 143, 148, 154, 159, 167, 175, 180, 184, 192, 201, 207, 212, 219, 226, 232, 240, 247, 255, 262, 268, 276, 283, 292, 300, 307, 314, 322, 331, 336, 346, 354
Offset: 1

Views

Author

Seiichi Manyama, Oct 06 2021

Keywords

Crossrefs

Programs

  • PARI
    a(n) = sum(k=2, n^2-1, isprime(k)&&k%4==1);

Formula

a(n) = A066339(n^2).
Showing 1-2 of 2 results.