Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Feb 16 2016 05:14:38
%S 2,3,13,17,23,47,137,257,521,577,727,739,1033,1153,1181,1471,2081,
%T 2113,3251,4129,4253,8209,8329,8353,11597,11677,11779,11971,12503,
%U 16417,17053,18433,18583,24799,26317,32801,32833,35267,35393,46703,52177,65537,66569,74257,92801,98327
%N Primes the squares of which are Fibbinary numbers (A003714).
%H Robert Israel, <a href="/A144759/b144759.txt">Table of n, a(n) for n = 1..505</a>
%e a(1)=2 since 2^2 is in A003714.
%p fibbin:= proc(n) Bits:-Xor(n,2*n) = 3*n end proc:
%p select(t -> isprime(t) and fibbin(t^2), [2,seq(i,i=3..10^5,2)]); # _Robert Israel_, Feb 15 2016
%o (PARI) msb(n)=my(k=1); while(k<=n, k<<=1); k>>1;
%o lista(nn) = {forprime(p=1, nn, n=p^2; k=bitand(n, n<<1); if(k, n=bitor(n, msb(k)-1), print1(p, ", ")););} \\ _Michel Marcus_, Feb 15 2016
%Y Cf. A003714, A001248.
%K nonn,base
%O 1,1
%A _Vladimir Shevelev_, Sep 20 2008
%E More terms from _Michel Marcus_, Feb 15 2016