|
|
A084307
|
|
a(n) is the least number x such that gcd(sigma(x), sigma(x+1)) = n.
|
|
3
|
|
|
1, 13, 17, 6, 199, 5, 242, 27, 391, 57, 1296, 22, 882, 12, 648, 93, 175232, 89, 3872, 236, 195, 1032, 4875263, 14, 5739271, 467, 35377, 83, 1882384, 58, 3024, 308, 29240, 201, 1627208, 118, 79524, 147, 1682, 56, 46854024, 82, 229441, 1204, 2047, 6301, 83386957823
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
n=9: GCD[sigma[x+1], sigma[x]]=5 holds for {391,799,800,881,...} of which the first is a(9)=391.
|
|
MATHEMATICA
|
f[x_] := GCD[DivisorSigma[1, x], DivisorSigma[1, x+1]] t=Table[0, {256}]; Do[s=f[n]; If[s<257&&t[[s]]==0, t[[s]]=n], {n, 1, 10000000}]; t
|
|
PROG
|
(PARI) a(n) = my(x=1, sx=sigma(x), y=2, sy=sigma(2)); while(gcd(sx, sy) != n, x++; y++; sx=sy; sy=sigma(y)); x; \\ Michel Marcus, Aug 28 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|