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.

A369107 a(n) is the number of numbers less than or equal to 10^n that are divisible only by primes congruent to 3 mod 4.

Original entry on oeis.org

4, 26, 201, 1680, 14902, 135124, 1243370, 11587149, 108941388, 1031330156, 9816605847
Offset: 1

Views

Author

Stefano Spezia, Jan 13 2024

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Length[Join[{1}, Select[Range[10^n], PrimeQ[f = First/@FactorInteger[#]] == Table[True, {j,PrimeNu[#]}] && Mod[f,4] == Table[3, {m,PrimeNu[#]}] && #<=10^n &]]]; Array[a, 10]
  • PARI
    is1(n) = {my(p = factor(n)[, 1]); for(i = 1, #p, if(p[i] % 4 == 1, return(0))); 1;};
    lista(nmax) = {my(c = 0, pow = 10, n = 1, nm = nmax + 1); forstep(k = 1, 10^nmax + 1, 2, if(k > pow, print1(c, ", "); pow *= 10; n++; if(n == nm, break)); if(is1(k), c++));} \\ Amiram Eldar, Jun 03 2024

Extensions

a(11) from Amiram Eldar, Jun 03 2024