login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100479 a(n) = prime(2n-1) + prime(2n). 1

%I #14 Feb 23 2024 07:33:10

%S 5,12,24,36,52,68,84,100,120,138,152,172,198,210,222,258,276,300,320,

%T 340,360,384,396,434,456,472,492,520,540,558,576,618,630,668,696,712,

%U 740,762,786,810,840,864,882,906,924,946,978,1002,1030,1064,1104,1132

%N a(n) = prime(2n-1) + prime(2n).

%H G. C. Greubel, <a href="/A100479/b100479.txt">Table of n, a(n) for n = 1..10000</a>

%H C. Caldwell <a href="https://t5k.org/lists/">Lists of small primes</a>.

%F a(n) = A001043(2n-1). - _R. J. Mathar_, Apr 20 2009

%F a(n) = A031368(n) + A031215(n). - _G. C. Greubel_, Apr 05 2023

%t Total/@Partition[Prime[Range[110]],2] (* _Harvey P. Dale_, Apr 20 2016 *)

%o (Magma) [(&+[NthPrime(2*n+j-1): j in [0..1]]): n in [1..70]]; // _G. C. Greubel_, Apr 05 2023

%o (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

%Y Cf. A000040, A001043, A031215, A031368.

%K nonn

%O 1,1

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 01:52 EDT 2024. Contains 375929 sequences. (Running on oeis4.)