This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A147814 #16 Jun 28 2021 10:49:53
%S A147814 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 A147814 14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
%U A147814 15,15,15,15,15,15,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17
%N A147814 Number of bits in Elias omega-coded prime numbers.
%C A147814 a(n) increases very slowly, gradually diverging from 3 + floor(log_2(n)).
%H A147814 Indranil Ghosh, <a href="/A147814/b147814.txt">Table of n, a(n) for n = 1..10000</a>
%H A147814 Wikipedia, <a href="https://en.wikipedia.org/wiki/Elias_omega_coding">Elias omega coding</a>
%F A147814 a(n) = 2 + Sum_{i=0..k} d(i), where
%F A147814 d(0) = bits(p_n)
%F A147814 d(x) = bits(d(x-1)-1)
%F A147814 ...
%F A147814 d(k) = 2,
%F A147814 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 A147814 Cf. A000040, A147764.
%K A147814 base,easy,nonn,uned
%O A147814 1,1
%A A147814 _Reikku Kulon_, Nov 13 2008