login
A055942
Smallest k > 1 such that k | Sigma(k) + n.
1
6, 2, 3, 2, 5, 2, 6, 2, 3, 2, 11, 2, 6, 2, 3, 2, 17, 2, 6, 2, 3, 2, 10, 2, 5, 2, 3, 2, 28, 2, 6, 2, 3, 2, 5, 2, 6, 2, 3, 2, 41, 2, 6, 2, 3, 2, 14, 2, 6, 2, 3, 2, 10, 2, 5, 2, 3, 2, 20, 2, 6, 2, 3, 2, 5, 2, 6, 2, 3, 2, 40, 2, 6, 2, 3, 2, 7, 2, 6, 2, 3, 2, 10, 2, 5, 2, 3, 2, 14, 2, 6, 2, 3, 2, 5, 2, 6, 2, 3
OFFSET
0,1
LINKS
MATHEMATICA
Do[ k = 2; While[ Mod[ DivisorSigma[ 1, k ] + n, k ] != 0, k++ ]; Print[ k ], {n, 0, 100} ]
PROG
(PARI) A055942(n) = for(k=2, oo, if(!((sigma(k)+n)%k), return(k))); \\ Antti Karttunen, Sep 30 2018
CROSSREFS
Cf. A000203.
Sequence in context: A196525 A300892 A291359 * A127916 A165063 A307234
KEYWORD
easy,nonn
AUTHOR
Robert G. Wilson v, Jul 18 2000
STATUS
approved