login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A146323
a(n)= integer part [ Sum_i=1..n (1/phi(i))]
0
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, 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, 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
OFFSET
1,2
COMMENTS
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,...). Lim_k-->oo [number of (k+1)`s / number of(k`s)] = sqrt(e).
MATHEMATICA
IntegerPart[Accumulate[1/EulerPhi[Range[110]]]] (* Harvey P. Dale, Dec 19 2015 *)
CROSSREFS
Sequence in context: A156079 A268708 A061555 * A071626 A182008 A375024
KEYWORD
nonn
AUTHOR
Ctibor O. Zizka, Oct 30 2008
STATUS
approved