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.

A053872 Primes arising in A053782.

This page as a plain text file.
%I A053872 #20 Apr 28 2025 11:06:12
%S A053872 37,199,277,367,997,1049,1103,1451,1709,1777,2137,2213,2953,3041,3407,
%T A053872 3889,3989,4091,5309,7193,7883,11113,13757,15083,16073,17093,28643,
%U A053872 28909,30259,32203,35089,35977,40879,42157,43451,43777,48119,51949
%N A053872 Primes arising in A053782.
%H A053872 Chai Wah Wu, <a href="/A053872/b053872.txt">Table of n, a(n) for n = 1..10000</a>
%t A053872 s=0;lst={};Do[If[PrimeQ[n],NULL,s+=n;If[PrimeQ[s],AppendTo[lst,s]]],{n,2,7!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Feb 01 2009 *)
%o A053872 (Python)
%o A053872 from sympy import isprime
%o A053872 A053872_list, n, m, s = [], 1, 4, 4
%o A053872 while len(A053872_list) < 10000:
%o A053872     if isprime(s):
%o A053872         A053872_list.append(s)
%o A053872     m += 1
%o A053872     if isprime(m):
%o A053872         m += 1
%o A053872     n += 1
%o A053872     s += m # _Chai Wah Wu_, May 13 2018
%o A053872 (PARI) lista(nn) = {my(s = 0); forcomposite(c=1, nn, s += c; if (isprime(s), print1(s, ", ")););} \\ _Michel Marcus_, May 13 2018
%Y A053872 Cf. A000040, A002808, A053782.
%K A053872 nonn
%O A053872 1,1
%A A053872 _G. L. Honaker, Jr._, Mar 30 2000
%E A053872 More terms from _Reiner Martin_, Jul 17 2001