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 A095078 #22 Dec 20 2024 05:21:07
%S A095078 2,5,11,13,23,29,47,59,61,191,223,239,251,383,479,503,509,991,1019,
%T A095078 1021,2039,3583,3967,4079,4091,4093,6143,15359,16127,16319,16381,
%U A095078 63487,65407,65519,129023,131063,245759,253951,261631,261887,262079
%N A095078 Primes with a single 0 bit in their binary expansion.
%C A095078 Except for the first value 2, the sequence gives the primes of the form 2^k -2^j -1 with 0 < j < k-1. If j=k-1 we obtain the Mersenne primes. - _Pierre CAMI_, May 19 2005
%C A095078 {2} UNION (A000040 INTERSECT A190620). - _Chai Wah Wu_, Dec 19 2024
%H A095078 T. D. Noe, <a href="/A095078/b095078.txt">Table of n, a(n) for n=1..1000</a>
%H A095078 A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%t A095078 Select[Prime[Range[23000]],DigitCount[#,2,0]==1&] (* _Harvey P. Dale_, Nov 28 2019 *)
%o A095078 (PARI)forprime(p=2,262079,v=binary(p);s=0;for(k=1,#v,s+=v[k]);if(#v-s==1,print1(p,", "))) \\ _Washington Bomfim_, Jan 13 2011
%Y A095078 Intersection of A000040 and A030130. Cf. A095058, A190620.
%K A095078 nonn,base,easy
%O A095078 1,1
%A A095078 _Antti Karttunen_, Jun 01 2004