|
Search: id:A084307
|
|
|
| A084307 |
|
a(n)=x is the least number such that GCD[sigma(x), sigma(x+1)]=n. |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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
|
|
CROSSREFS
|
Cf. A000203, A065444, A060780.
Sequence in context: A107081 A029526 A061060 this_sequence A066918 A164062 A117326
Adjacent sequences: A084304 A084305 A084306 this_sequence A084308 A084309 A084310
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 13 2003
|
|
|
Search completed in 0.002 seconds
|
