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 A274070 #34 Feb 08 2024 12:44:45
%S A274070 0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T A274070 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,
%U A274070 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2
%N A274070 Integer part of the sum of the inverses of the first n primes.
%C A274070 The sequence is unbounded.
%H A274070 Carl Erickson, <a href="http://people.brandeis.edu/~cwe/pdfs/primes_and_riemann.pdf">Prime Numbers and the Riemann Hypothesis</a>
%F A274070 a(n) = floor(Sum_{i=1..n} 1/A000040(i)).
%F A274070 a(n) = floor(A024451(n)/A002110(n)). - _Antti Karttunen_, Feb 08 2024
%t A274070 Table[Floor@Sum[1/(Prime[j]), {j, 1, n}], {n, 1, 120}]
%Y A274070 Cf. A002110, A024451, A046024 (places of records).
%K A274070 nonn
%O A274070 1,59
%A A274070 _Andres Cicuttin_, Jun 19 2016