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.
%I A100479 #17 Jan 20 2025 06:05:17 %S A100479 5,12,24,36,52,68,84,100,120,138,152,172,198,210,222,258,276,300,320, %T A100479 340,360,384,396,434,456,472,492,520,540,558,576,618,630,668,696,712, %U A100479 740,762,786,810,840,864,882,906,924,946,978,1002,1030,1064,1104,1132 %N A100479 a(n) = prime(2n-1) + prime(2n). %H A100479 G. C. Greubel, <a href="/A100479/b100479.txt">Table of n, a(n) for n = 1..10000</a> %H A100479 C. Caldwell <a href="https://t5k.org/lists/">Lists of small primes</a>. %F A100479 a(n) = A001043(2n-1). - _R. J. Mathar_, Apr 20 2009 %F A100479 a(n) = A031368(n) + A031215(n). - _G. C. Greubel_, Apr 05 2023 %p A100479 A100479 := proc(n) %p A100479 ithprime(2*n-1)+ithprime(2*n) ; %p A100479 end proc: %p A100479 seq(A100479(n),n=1..50) ; # _R. J. Mathar_, Jan 20 2025 %t A100479 Total/@Partition[Prime[Range[110]],2] (* _Harvey P. Dale_, Apr 20 2016 *) %o A100479 (Magma) [(&+[NthPrime(2*n+j-1): j in [0..1]]): n in [1..70]]; // _G. C. Greubel_, Apr 05 2023 %o A100479 (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 A100479 Cf. A092163, A001043, A031215, A031368. %K A100479 nonn %O A100479 1,1 %A A100479 Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Nov 22 2004