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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276043 Least k such that n divides d(sigma(k)) (d = A000005). 0
 1, 2, 3, 5, 33, 6, 105, 14, 22, 33, 651, 24, 2667, 105, 66, 54, 57337, 88, 172011, 114, 210, 1302, 2752491, 120, 510, 5334, 472, 378, 199753347, 264 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE a(5) = 33 because 5 divides A000005(A000203(33)) = 10. MATHEMATICA Table[k = 1; While[! Divisible[DivisorSigma[0, #] &@ DivisorSigma[1, k], n], k++]; k, {n, 28}] (* Michael De Vlieger, Aug 21 2016 *) PROG (PARI) a(n) = {my(k = 1); while(numdiv(sigma(k)) % n, k++); k; } CROSSREFS Cf. A000005, A000203, A062068. Sequence in context: A163079 A109845 A241722 * A041019 A041977 A261130 Adjacent sequences:  A276040 A276041 A276042 * A276044 A276045 A276046 KEYWORD nonn,more AUTHOR Altug Alkan, Aug 17 2016 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.

Last modified September 22 11:29 EDT 2020. Contains 337289 sequences. (Running on oeis4.)