|
%I #16 Jun 28 2021 10:49:53
%S 4,4,7,7,8,8,12,12,12,12,12,13,13,13,13,13,13,13,14,14,14,14,14,14,14,
%T 14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
%U 15,15,15,15,15,15,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17
%N Number of bits in Elias omega-coded prime numbers.
%C a(n) increases very slowly, gradually diverging from 3 + floor(log_2(n)).
%H Indranil Ghosh, <a href="/A147814/b147814.txt">Table of n, a(n) for n = 1..10000</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Elias_omega_coding">Elias omega coding</a>
%F a(n) = 2 + Sum_{i=0..k} d(i), where
%F d(0) = bits(p_n)
%F d(x) = bits(d(x-1)-1)
%F ...
%F d(k) = 2,
%F and bits(p_n) = 1 + floor(log_2(prime(n))) is the number of bits in the binary representation of the n-th prime.
%Y Cf. A000040, A147764.
%K base,easy,nonn,uned
%O 1,1
%A _Reikku Kulon_, Nov 13 2008
|
