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 A033875 #35 Jan 08 2023 15:23:23 %S A033875 2,3,5,7,11,13,17,19,23,31,47,79,83,211,227,229,233,241,257,769,773 %N A033875 Skipping from prime to prime by least powers of 2. %C A033875 Is this sequence infinite? - _Charles R Greathouse IV_, Jan 24 2017 %H A033875 Zak Seidov, <a href="/A033875/b033875.txt">Table of n, a(n) for n = 1..23</a> %F A033875 a(1) = 2, a(n+1) = a(n) + 2^k; a(n+1) prime, k minimal. %F A033875 a(n) = a(n-1) + 2^A067760((a(n-1)-1)/2) for n >= 3. - _Pontus von Brömssen_, Jan 08 2023 %e A033875 2 + 2^0 = 3, %e A033875 3 + 2^1 = 5, %e A033875 a(22) = a(21) + 2^955, %e A033875 a(23) = a(22) + 2^468. %t A033875 NestList[(k = 0; While[! PrimeQ[q = # + 2^k], k++]; q) &, 2, 20] (* _Zak Seidov_, Jan 24 2017 *) %Y A033875 Cf. A059661, A067760, A139803 (corresponding powers of 2). %K A033875 nonn %O A033875 1,1 %A A033875 _David W. Wilson_