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 A146323 #15 Jul 04 2025 12:36:31
%S A146323 1,2,2,3,3,3,3,4,4,4,4,4,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,
%T A146323 6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,
%U A146323 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9
%N A146323 a(n) = floor(Sum_{i=1..n} (1/phi(i))).
%C A146323 Looking on the number of 1's, 2's, ..., k's in this sequence we obtain the sequence (1,2,4,5,9,16,25,42,72,...). Limit_{k->oo} (number of (k+1)'s / number of(k's)) = sqrt(e).
%C A146323 The limit above is wrong. The correct limit is exp(zeta(6)/(zeta(2)*zeta(3))) = exp(1/A082695) = 1.672818789624... . - _Amiram Eldar_, Jul 04 2025
%H A146323 Amiram Eldar, <a href="/A146323/b146323.txt">Table of n, a(n) for n = 1..10000</a>
%F A146323 a(n) = floor(A028415(n)/A048049(n)). - _Amiram Eldar_, Jul 04 2025
%t A146323 IntegerPart[Accumulate[1/EulerPhi[Range[110]]]] (* _Harvey P. Dale_, Dec 19 2015 *)
%o A146323 (PARI) list(lim) = {my(s = 0); for(k = 1, lim, s += 1/eulerphi(k); print1(floor(s), ", "));} \\ _Amiram Eldar_, Jul 04 2025
%Y A146323 Cf. A000010, A028415, A048049, A074467, A082695.
%K A146323 nonn
%O A146323 1,2
%A A146323 _Ctibor O. Zizka_, Oct 30 2008