login
A147814
Number of bits in Elias omega-coded prime numbers.
2
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, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17
OFFSET
1,1
COMMENTS
a(n) increases very slowly, gradually diverging from 3 + floor(log_2(n)).
LINKS
FORMULA
a(n) = 2 + Sum_{i=0..k} d(i), where
d(0) = bits(p_n)
d(x) = bits(d(x-1)-1)
...
d(k) = 2,
and bits(p_n) = 1 + floor(log_2(prime(n))) is the number of bits in the binary representation of the n-th prime.
CROSSREFS
Sequence in context: A023404 A140245 A200364 * A168233 A238391 A049647
KEYWORD
base,easy,nonn,uned
AUTHOR
Reikku Kulon, Nov 13 2008
STATUS
approved