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.

A093433 a(n) = (p(1)*...*p(n)) + (p(n+1)*...*p(2n)) where p(n) is the n-th prime.

Original entry on oeis.org

2, 5, 41, 1031, 46399, 2803043, 247140857, 25627356863, 3359824134707, 525738142728791, 86239154183764823, 16043263583368582931, 3203015861712721419161, 765364544804215147351277, 196164712685969109811322179, 51407675872783850510756055649
Offset: 0

Views

Author

Jason Earls, May 12 2004

Keywords

Examples

			a(5) = 2803043 because 2*3*5*7*11 + 13*17*19*23*29 = 2803043.
		

Crossrefs

Programs

  • Maple
    a:= n-> add(mul(ithprime(i+j), i=1..n), j=[0, n]):
    seq(a(n), n=0..20);  # Alois P. Heinz, Apr 13 2024

Formula

a(n) = A002110(n) + A107712(n).