cp's OEIS Frontend

A055011 a(n+1) = next smallest prime beginning with a(n) when written in binary, starting with 2.

%I A055011 #18 May 06 2017 13:34:10
%S A055011 2,5,11,23,47,191,383,3067,12269,196307,6281839,50254717,201018869,
%T A055011 804075479,1608150959,102921661397,1646746582367,13173972658937,
%U A055011 105391781271503,210783562543007,3372537000688127,26980296005505019,863369472176160611,6906955777409284889
%N A055011 a(n+1) = next smallest prime beginning with a(n) when written in binary, starting with 2.
%C A055011 a(5)=191 because a(4)=47 which in binary is 101111, none of 1011110(94) 1011111(95) 10111100(188) 10111101(189) 10111110 (190) are prime, but 10111111(191) is.
%F A055011 a(n+1) = A208241(a(n)). - _Reinhard Zumkeller_, Feb 14 2013
%p A055011 A055011 := proc(n)
%p A055011     option remember;
%p A055011     if n = 0 then
%p A055011         2 ;
%p A055011     else
%p A055011         A208241(procname(n-1)) ;
%p A055011     end if;
%p A055011 end proc: # _R. J. Mathar_, May 06 2017
%o A055011 (Haskell)
%o A055011 a055011 n = a055011_list !! n
%o A055011 a055011_list = iterate a208241 2  -- _Reinhard Zumkeller_, Feb 14 2013
%Y A055011 Cf. A048549 for base 10 analog.
%Y A055011 A055011, A261200 and A261201 are all essentially the same sequence.
%K A055011 base,easy,nonn
%O A055011 0,1
%A A055011 _Henry Bottomley_, May 31 2000