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.

A076873 Smallest prime not less than sum of first n primes.

Original entry on oeis.org

2, 5, 11, 17, 29, 41, 59, 79, 101, 131, 163, 197, 239, 281, 331, 383, 443, 503, 569, 641, 719, 797, 877, 967, 1061, 1163, 1277, 1373, 1481, 1597, 1721, 1861, 1993, 2129, 2281, 2437, 2591, 2749, 2917, 3089, 3271, 3449, 3643, 3833, 4049, 4229, 4441, 4663
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 27 2002

Keywords

Comments

a(n) = A007918(A007504(n)).

Examples

			n=5: 2+3+5+7+11 <= 29 = a(5).
		

Crossrefs

Programs

  • Maple
    P:= [seq(ithprime(i),i=1..100)]:
    S:= ListTools:-PartialSums(P):
    map(s -> nextprime(s-1),S); # Robert Israel, Jul 04 2019
  • Mathematica
    If[PrimeQ[#],#,NextPrime[#]]&/@Accumulate[Prime[Range[50]]]  (* Harvey P. Dale, Feb 04 2011 *)