login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..65537

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

Adjacent sequences:  A055939 A055940 A055941 * A055943 A055944 A055945

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v, Jul 18 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 16:47 EST 2020. Contains 331114 sequences. (Running on oeis4.)