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.

A145197 Partial sums of number of primes < n-th prime p such that p+2 is prime.

Original entry on oeis.org

0, 1, 3, 5, 8, 11, 15, 19, 23, 28, 33, 38, 44, 50, 56, 62, 69, 76, 83, 91, 99, 107, 115, 123, 131, 140, 149, 159, 169, 179, 189, 199, 210, 221, 233, 245, 257, 269, 281, 293, 306, 319, 333, 347, 362, 377, 392, 407, 423, 439, 455, 472, 489, 506, 523, 540, 558, 576
Offset: 1

Views

Author

Giovanni Teofilatto, Oct 04 2008

Keywords

Comments

Partial sums of A082462. [R. J. Mathar, Oct 06 2008]

Programs

  • Maple
    isA001359 := proc(p) if isprime(p) and isprime(p+2) then 1; else 0; fi; end: A082462 := proc(n) add( isA001359(ithprime(i)),i=1..n) ; end: A145197 := proc(n) add( A082462(i),i=1..n) ; end: for n from 1 to 200 do printf("%d,",A145197(n)) ; od: # R. J. Mathar, Oct 06 2008

Extensions

Corrected and extended by R. J. Mathar, Oct 06 2008