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.

A125825 Numbers m that divide 2^6 + 3^6 + 5^6 + ... + prime(m)^6.

Original entry on oeis.org

1, 4357, 230065, 32826947, 29578097627, 136736829787, 1449657373945, 39153480154471, 275533558444523, 442844575927975, 879110348271737
Offset: 1

Views

Author

Alexander Adamchuk, Feb 03 2007

Keywords

Comments

a(12) > 10^15. - Paul W. Dyson, Nov 19 2024

Crossrefs

Cf. A236182.

Programs

  • Mathematica
    s = 0; Do[s = s + Prime[n]^6; If[ Mod[s, n] == 0, Print[n]], {n, 240000}]
  • PARI
    s=0;n=0;forprime(p=2,4e9,s+=p^6;if(s%n++==0,print1(n", "))) \\ Charles R Greathouse IV, Mar 15 2011

Extensions

a(4) from Stefan Steinerberger, May 10 2007
a(5)-a(6) from Charles R Greathouse IV, Mar 15 2011 to Mar 19 2011
a(7) from Paul W. Dyson, Jan 08 2021
a(8) from Bruce Garner, Jul 10 2021
a(9) from Paul W. Dyson, Oct 21 2022
a(10) from Paul W. Dyson, Oct 31 2022
a(11) from Paul W. Dyson, Dec 08 2022