|
|
A084303
|
|
Smallest x such that sigma(x) mod 6 = n.
|
|
5
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
n=5: sigma(2401) = 1+7+49+343+2401 = 2801 = 6*466+5, hence a(5)=2401.
|
|
MATHEMATICA
|
Table[k = 1; While[Mod[DivisorSigma[1, k], 6] != n, k++]; k, {n, 0, 5}] (* Michael De Vlieger, Mar 25 2017 *)
|
|
PROG
|
(PARI) a(n) = {my(x = 1); while((sigma(x) % 6) != n, x++); x; } \\ Michel Marcus, Dec 18 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,fini,full,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|