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.

A360511 a(n) = Product_{i=1..n} p(i) - p(n+1)^3, where p(i) is the i-th prime.

Original entry on oeis.org

-25, -119, -313, -1121, 113, 25117, 503651, 9687523, 223068481, 6469663439, 200560439477, 7420738065889, 304250263447703, 13082761331566207, 614889782588342533, 32589158477189839351, 1922760350154212412089, 117288381359406970682507, 7858321551080267055521179, 557940830126698960967026373
Offset: 1

Views

Author

N. J. A. Sloane, Feb 24 2023

Keywords

Comments

It is known that a(n) >= 0 for n >= 5.

References

  • S. W. Golomb, Elementary Problem E3137, Amer. Math. Monthly, Proposed 93 (1986), p. 215; Solution and Editorial Comments, 94 (1987), 883-884.

Crossrefs

Programs

  • Mathematica
    FoldList[Times, Most[#]] - Rest[#]^3 & [Prime[Range[25]]] (* Paolo Xausa, Nov 06 2024 *)
  • Python
    from sympy import prime, primorial
    def A360511(n): return primorial(n)-prime(n+1)**3 # Chai Wah Wu, Feb 24 2023