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.

A361300 Numbers of the form m^2 + p^2 for p prime and m > 0.

Original entry on oeis.org

5, 8, 10, 13, 18, 20, 25, 26, 29, 34, 40, 41, 45, 50, 53, 58, 61, 65, 68, 73, 74, 85, 89, 90, 98, 104, 106, 109, 113, 122, 125, 130, 137, 146, 148, 149, 153, 157, 169, 170, 173, 178, 185, 193, 194, 200, 202, 205, 218, 221, 229, 233, 234, 242
Offset: 1

Views

Author

Keywords

Comments

Rieger proves that there are >> x/log x terms of this sequence up to x, and together with the trivial upper bound << x/log x this shows that a(n) ≍ n log n. (Rieger does not prove that a(n) ~ n log n, the constant factor may be larger.)

Crossrefs

Subsequence of A000404; A185086 is a subsequence.

Programs

  • PARI
    list(lim)=my(v=List()); forprime(p=2,sqrtint(lim\=1), my(p2=p^2); for(m=1,sqrtint(lim-p2), listput(v,p2+m^2))); Set(v)