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 A169628 #23 Jan 11 2025 03:16:22
%S A169628 3,5,7,17,19,31,65,67,79,127,4097,4099,4111,4159,8191,65537,65539,
%T A169628 65551,65599,69631,131071,262145,262147,262159,262207,266239,327679,
%U A169628 524287,1073741825,1073741827,1073741839,1073741887,1073745919,1073807359
%N A169628 Semi-sums (average) of two (not necessarily distinct) Mersenne primes (A000668).
%C A169628 Since all terms of A000668 are odd, the semi-sum of any two terms is an integer. This motivated introduction of this sequence, equal to (1/2) * A171251, see there for further information.
%H A169628 Vincenzo Librandi, <a href="/A169628/b169628.txt">Table of n, a(n) for n = 1..150</a>
%H A169628 Jonathan Vos Post, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2010-March/003808.html">Sums of three Mersenne primes, and prime sums of three Mersenne primes</a>, SeqFan list, Mar 5, 2010.
%F A169628 a(n) = (1/2)*A171251(n) = (A000668(i) + A000668(j))/2, where n = i*(i-1)/2+j, i >= j >= 1.
%F A169628 a(A000217(n)) = A000668(n).
%e A169628 a(1) = (A000668(1) + A000668(1))/2,
%e A169628 a(2) = (A000668(2) + A000668(1))/2,
%e A169628 a(3) = (A000668(2) + A000668(2))/2,
%e A169628 a(4) = (A000668(3) + A000668(1))/2, ...
%t A169628 Union[Mean/@Tuples[Select[2^Prime[Range[20]]-1, PrimeQ],{2}]] (* _Harvey P. Dale_, Mar 12 2011 *)
%o A169628 (PARI) concat(vector(#A000668,i,vector(i,j,A000668[i]+A000668[j])))/2 /* having defined A000668 to be vector with initial terms of A000668 */
%Y A169628 Cf. A171253 (using only distinct terms of A000668), A171254 (primes in this sequence).
%K A169628 nonn
%O A169628 1,1
%A A169628 _M. F. Hasler_, Mar 06 2010