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 A373804 #14 Oct 20 2024 23:58:52 %S A373804 3,19,103,283,313,331,463,733,751,757,1093,1153,1213,1453,1543,1783, %T A373804 2083,2251,2371,2467,2671,2707,2803,3733,3823,7603,7723,8221,9013, %U A373804 9661,14983,15277,15607,16363,16381,16843,17923,19483,20287,21061,22093,23173,24421,24841,25903,27211,28411 %N A373804 Primes in A374965 sorted into increasing order. %C A373804 Since we know the first 350199 terms of A374965, and A374965(350199) = 5026186 starts a new doubling chain, we know that any subsequent prime is greater than 5026186. This implies that the terms in the b-file, which are < 5026186, are correct. Of course, if the sequence reaches a Riesel number (cf. A076337) there will be no more primes after that point. %C A373804 Note that, as can be seen from the b-file in A375028, A374965 contains many primes greater than 5026186 among the first 350199 terms, including one prime with 102410 digits. But these large primes cannot be added to the present b-file until more is discovered about primes following term 350199. %H A373804 N. J. A. Sloane, <a href="/A373804/b373804.txt">Table of n, a(n) for n = 1..184</a> %H A373804 N. J. A. Sloane, <a href="https://www.youtube.com/watch?v=3RAYoaKMckM">A Nasty Surprise in a Sequence and Other OEIS Stories</a>, Experimental Mathematics Seminar, Rutgers University, Oct 10 2024, Youtube video; <a href="https://sites.math.rutgers.edu/~zeilberg/expmath/sloane85BD.pdf">Slides</a> [Mentions this sequence] %Y A373804 Cf. A374965, A375028, A373799, A076337. %K A373804 nonn %O A373804 1,1 %A A373804 _N. J. A. Sloane_, Aug 08 2024