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

A071170
n-th prime reduced modulo sigma(n).
2
0, 0, 1, 0, 5, 1, 1, 4, 10, 11, 7, 9, 13, 19, 23, 22, 5, 22, 7, 29, 9, 7, 11, 29, 4, 17, 23, 51, 19, 41, 31, 5, 41, 31, 5, 60, 5, 43, 55, 83, 11, 85, 15, 25, 41, 55, 19, 99, 56, 43, 17, 43, 25, 11, 41, 23, 29, 1, 37, 113, 35, 5, 99, 57, 61, 29, 59, 85, 59, 61, 65, 164, 71, 31, 7
OFFSET
1,5
FORMULA
a(n) = Mod(prime(n), sigma(n)) = Mod(A000040(n), A000203(n)).
EXAMPLE
n=25,p(25)=97, sigma(25)=31, Mod[97,31]=4=a[25]
MATHEMATICA
Table[Mod[Prime[w], DivisorSigma[1, w]], {w, 1, 128}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, May 15 2002
STATUS
approved