A037228 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A037228

a(n) = phi(n) - pi(n).

1, 0, 0, 0, 1, -1, 2, 0, 2, 0, 5, -1, 6, 0, 2, 2, 9, -1, 10, 0, 4, 2, 13, -1, 11, 3, 9, 3, 18, -2, 19, 5, 9, 5, 13, 1, 24, 6, 12, 4, 27, -1, 28, 6, 10, 8, 31, 1, 27, 5, 17, 9, 36, 2, 24, 8, 20, 12, 41, -1, 42, 12, 18, 14, 30, 2, 47, 13, 25, 5, 50, 4, 51, 15, 19, 15, 39, 3, 56, 10, 32, 18, 59, 1, 41, 19

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,7

COMMENTS

It is known that a(n) >= 0 for n >= 61.

REFERENCES

D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, p. 11.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)

MATHEMATICA

Table[EulerPhi[n]-PrimePi[n], {n, 90}] (* Harvey P. Dale, Feb 02 2021 *)

PROG