%I #7 Oct 03 2015 23:15:03
%S 10,100101,100101011101,100101011101011101,
%T 1001010111010111010111011111,100101011101011101011101111101011111,
%U 100101011101011101011101111101011111011101,1001010111010111010111011111010111110111010111011111,100101011101011101011101111101011111011101011101111101111101,1001010111010111010111011111010111110111010111011111011111010111110111,100101011101011101011101111101011111011101011101111101111101011111011101011111,1001010111010111010111011111010111110111010111011111011111010111110111010111110111011111
%N Bisection of A139101.
%F a(n) = A139101(2n). - _R. J. Mathar_, Apr 25 2008
%p A139101 := proc(n) option remember ; local a,p; if n = 1 then RETURN(1); else a := 10*A139101(n-1) ; for p from ithprime(n-1)+1 to ithprime(n)-1 do a := 10*a+1 ; od: fi ; RETURN(a) ; end: A139106 := proc(n) A139101(2*n) ; end: seq(A139106(n),n=1..12) ; # _R. J. Mathar_, Apr 25 2008
%Y Cf. A139101.
%K easy,nonn,base,less
%O 1,1
%A _Omar E. Pol_, Apr 08 2008
%E More terms from _R. J. Mathar_, Apr 25 2008
|