|
%I #10 Jul 13 2015 21:09:06
%S 1,0,2,0,4,2,14,12,8,2,0,26,22,20,16,10,4,2,60,56,54,48,44,38,30,26,
%T 24,20,18,14,0,124,118,116,106,104,98,92,88,82,76,74,64,62,58,56,44,
%U 32,28,26,22,16,14,4,254,248,242,240,234,230,228,218,204,200,198,194,180,174
%N Write the n-th prime in binary. Change all 0's to 1's and all 1's to 0's. a(n) is the decimal equivalent of the result.
%C a(n) = A035327(p(n)), where p(n) is the n-th prime.
%F a(n)=2^{1+floor(log[2](p(n)))}-n-1, where p(n) is the n-th prime. - _Emeric Deutsch_, Oct 19 2008
%p f:=proc(n) options operator, arrow: 2^(1+floor(log[2](n)))-n-1 end proc: seq(f(ithprime(n)),n=1..71); # _Emeric Deutsch_, Oct 19 2008
%Y A171008 gives the binary expansions. Cf. A035327.
%K base,nonn
%O 1,3
%A _Leroy Quet_, Oct 09 2008
%E Extended by _Emeric Deutsch_, Oct 19 2008
|
