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.

A100479 a(n) = prime(2n-1) + prime(2n).

Original entry on oeis.org

5, 12, 24, 36, 52, 68, 84, 100, 120, 138, 152, 172, 198, 210, 222, 258, 276, 300, 320, 340, 360, 384, 396, 434, 456, 472, 492, 520, 540, 558, 576, 618, 630, 668, 696, 712, 740, 762, 786, 810, 840, 864, 882, 906, 924, 946, 978, 1002, 1030, 1064, 1104, 1132
Offset: 1

Views

Author

Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Nov 22 2004

Keywords

Crossrefs

Programs

  • Magma
    [(&+[NthPrime(2*n+j-1): j in [0..1]]): n in [1..70]]; // G. C. Greubel, Apr 05 2023
    
  • Maple
    A100479 := proc(n)
        ithprime(2*n-1)+ithprime(2*n) ;
    end proc:
    seq(A100479(n),n=1..50) ; # R. J. Mathar, Jan 20 2025
  • Mathematica
    Total/@Partition[Prime[Range[110]],2] (* Harvey P. Dale, Apr 20 2016 *)
  • SageMath
    [sum(nth_prime(2*n+j-1) for j in range(2)) for n in range(1, 71)] # G. C. Greubel, Apr 05 2023

Formula

a(n) = A001043(2n-1). - R. J. Mathar, Apr 20 2009
a(n) = A031368(n) + A031215(n). - G. C. Greubel, Apr 05 2023