|
%I #14 Apr 14 2021 05:26:38
%S 1,1,5,7,22,39,84,173,367,716,1444,2945,5823,11817,23457,47117,94496,
%T 188670,378296,755437,1512435,3024742,6049260,12099777,24205776,
%U 48402649,96809896,193632363,387252738,774544273,1549044943
%N Base-2 logarithm of product of primes between 2^n+1 and 2^(n+1).
%C Inspired by Bertrand's postulate and complexity of algorithms using Farey fraction sets of size 2^n.
%C The log of this sequence seems linear after a few terms.
%t Table[Floor[
%t Log[2, Times @@
%t Table[Prime[i], {i, PrimePi[2^(n)] + 1,
%t PrimePi[2^(n + 1)]}]]], {n, 0, 20}]
%Y Cf. A036378 (number of primes between 2^n+1 and 2^(n+1).
%Y Cf. A293696, A293697 (additive view of the primes between 2^n+1 and 2^(n+1).
%K nonn,more
%O 0,3
%A _Olivier Gérard_, Oct 24 2017
%E a(26)-a(30) from _Robert Price_, Nov 30 2017
|
