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.

A024529 a(n) = s(1)*s(2)*...*s(n)*(1/s(1) - 1/s(2) + ... + c/s(n)), where s(1) = 1, s(k) = p(k-1) for k >= 2 and c = (-1)^(n+1).

Original entry on oeis.org

1, 1, 5, 19, 163, 1583, 22889, 359083, 7333087, 158961311, 4832970889, 143352404329, 5504599450303, 218267839327613, 9689767354614569, 442336304335214713, 24058713912354871199, 1386874962351747356011
Offset: 1

Views

Author

Keywords

Programs

  • PARI
    a(n)=if(n<1,n>0,prod(i=1,n-1, prime(i))*sum(i=1,n-1,(-1)^i/prime(i),1)) /* Michael Somos, Feb 01 2004 */

Formula

a(n+1) = a(n)*prime(n) + (-1)^n*primorial(prime(n-1)) for n >= 3. - Alexandre Herrera, Sep 03 2023