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.

Showing 1-2 of 2 results.

A126144 Primes in A109790.

Original entry on oeis.org

3, 5, 7, 19, 47, 73, 97, 131, 223, 229, 257, 263, 277, 331, 367, 389, 397, 487, 577, 641, 643, 683, 701, 739, 743, 757, 797, 857, 877, 1031, 1291, 1297, 1423, 1451, 1543, 1579, 1637, 1697, 1723, 1823, 1949, 2039, 2081, 2381, 2477, 2539, 2617, 2659, 2689, 2749
Offset: 1

Views

Author

J. M. Bergot, Jun 11 2007

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Select[Range[3000], PrimeQ[Sum[Prime[Prime[i]],{i,1,#}]]&],PrimeQ[ # ] &] (* Stefan Steinerberger, Jun 23 2007 *)

Extensions

More terms from Stefan Steinerberger, Jun 23 2007

A083186 Sum of the first n primes whose indices are primes.

Original entry on oeis.org

3, 8, 19, 36, 67, 108, 167, 234, 317, 426, 553, 710, 889, 1080, 1291, 1532, 1809, 2092, 2423, 2776, 3143, 3544, 3975, 4436, 4945, 5492, 6055, 6642, 7241, 7858, 8567, 9306, 10079, 10876, 11735, 12612, 13531, 14498, 15489, 16520, 17583, 18670, 19823
Offset: 1

Views

Author

Cino Hilliard, Jun 01 2003

Keywords

Comments

Partial sums of A006450.

Crossrefs

Programs

  • Mathematica
    Accumulate[Prime[Prime[Range[50]]]] (* Harvey P. Dale, Jun 24 2012 *)
  • PARI
    pipsum(n)=s=0; sr=0; for(x=1,n, y=prime(prime(x)); s+=y; print1(s" "); sr+=1.0/y; ); print(); print(sr)
    
  • PARI
    a(n)=my(i,j,s); forprime(p=2,, if(isprime(i++), s+=p; if(j++==n, return(s)))) \\ Charles R Greathouse IV, Oct 20 2015
    
  • PARI
    first(n)=my(v=vector(n),i,j,s); forprime(p=2,, if(isprime(i++), s+=p; v[j++]=s; if(j==n, return(v)))) \\ Charles R Greathouse IV, Oct 20 2015

Formula

a(n) = Sum_{k=1..n} prime(prime(k)).
a(n) ~ (n log n)^2 / 2. - Charles R Greathouse IV, Oct 20 2015
Showing 1-2 of 2 results.