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

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, 677207307, 312, 3810, 114674, 2130, 520, 43346476299, 344022, 14322, 540, 698915267211, 840, 2795677065867, 5208
OFFSET
1,2
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
KEYWORD
nonn
AUTHOR
Altug Alkan, Aug 17 2016
EXTENSIONS
More terms from Jinyuan Wang, Jan 23 2021
STATUS
approved