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 A343976 #18 May 08 2021 06:21:56 %S A343976 3,5,7,11,13,23,47,71,109,131,139,181,193,229,251,281,349,379,383,401, %T A343976 419,461,499,659,701,709,761,821,859,911,919,1021,1091,1129,1231,1259, %U A343976 1399,1451,1489,1549,1709,1721,1759,1811,1861,1871,1931,2029,2081,2113,2141,2179,2221,2293,2339,2399 %N A343976 Primes that are the sum of two consecutive terms of A093641. %C A343976 Any term of A093641 that is the sum of two consecutive terms of A093641 is prime. %H A343976 Robert Israel, <a href="/A343976/b343976.txt">Table of n, a(n) for n = 1..10000</a> %e A343976 a(10) = 131 is a term because 131 = 64+67 = A093641(43)+ A093641(44) and is prime. %p A343976 N:= 10^4: # for terms <= N %p A343976 R:= seq(2^i,i=0..ilog2(N/2)): %p A343976 p:= 3: %p A343976 while p <= N/2 do %p A343976 R:= R, seq(p*2^i,i=0..floor(log[2](N/2/p))); %p A343976 p:= nextprime(p); %p A343976 od: %p A343976 R:= sort([R]): %p A343976 select(isprime,R); %Y A343976 Cf. A093641. %K A343976 nonn %O A343976 1,1 %A A343976 _J. M. Bergot_ and _Robert Israel_, May 06 2021