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

A087625
Number of primes in the ring Z_n.
3
0, 0, 0, 1, 0, 3, 0, 2, 2, 5, 0, 4, 0, 7, 6, 4, 0, 8, 0, 6, 8, 11, 0, 8, 4, 13, 6, 8, 0, 14, 0, 8, 12, 17, 10, 10, 0, 19, 14, 12, 0, 20, 0, 12, 14, 23, 0, 16, 6, 24, 18, 14, 0, 24, 14, 16, 20, 29, 0, 20, 0, 31, 18, 16, 16, 32, 0, 18, 24, 34, 0, 20, 0, 37, 28, 20, 16, 38, 0, 24, 18, 41, 0, 28, 20, 43, 30, 24, 0, 38, 18, 24, 32, 47, 22, 32, 0, 48
OFFSET
1,6
COMMENTS
a(n) <= n-phi(n)-1.
LINKS
FORMULA
a(n)=Sum'_{p|n} A087623(p, n), where the sum is over all primes p < n, p | n.
a(p)=0 if p prime.
a(p^k)=p^{k-2}(p-1) if p prime, k>=2.
a(p^k q)=p^{k-2}(p-1)(p+q-1) if p, q primes (q!=p), k>=2.
a(pq)=p+q-2 if p, q primes, p!=q.
A(p^k q^h)=p^{k-2}q^{h-2}(p-1)(q-1)(p+q) if p, q primes (q!=p),
EXAMPLE
a(6)=3 because the three primes in Z_6 are 2,3,4, being 2 and 4 associates. a(500)=5(2-1)(5-1)(2+5)=140.
PROG
(PARI) A087625(n) = sumdiv(n, p, if((p<n)&&isprime(p), sum(k=1, n-1, (gcd(k, n)==p)), 0)); \\ Antti Karttunen, Mar 04 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michele Dondi (bik.mido(AT)tiscalinet.it), Sep 14 2003
EXTENSIONS
More terms from Antti Karttunen, Mar 04 2018
STATUS
approved