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 A080340 #27 Apr 25 2025 10:30:18 %S A080340 7629217,18814027,29998837,41183647,52368457,63553267,74738077, %T A080340 85922887,97107697,108292507,119477317,130662127,141846937,153031747, %U A080340 164216557,175401367,186586177,197770987,208955797,220140607,231325417,242510227 %N A080340 First known infinite sequence containing no odd integer of the form 2^m+p (p prime). %C A080340 To a question of Romanoff: Are there infinitely many odd integers not of the form 2^m+p where p is prime? Erdős answered Yes in 1950 by constructing the present sequence, an infinite arithmetic sequence, using a system of congruences. %H A080340 P. Erdős, <a href="https://users.renyi.hu/~p_erdos/1950-07.pdf">On integers of form 2^n+p and some related problems</a>, Summa Brasil Math.11 (1950), pp. 1-11. %H A080340 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A080340 T. Zamojski, <a href="https://web.archive.org/web/20040728125902/http://www.math.mcgill.ca/~dsavitt/nt/projects/zamojski.ps">Survey on covering congruences</a>. %H A080340 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A080340 a(n) = n*11184810 + 7629217. %F A080340 G.f.: (7629217 + 3555593*x)/(1 - x)^2. - _Stefano Spezia_, Apr 25 2025 %K A080340 nonn,easy %O A080340 0,1 %A A080340 _Benoit Cloitre_, Mar 19 2003