|
Search: id:A126160
|
|
|
| A126160 |
|
Number of betrothed pairs (m,n) with m <=10^k (and k=1,2,3,...), where a betrothed pair satisfies sigma(m)=sigma(n)=m+n+1 and m<n. |
|
+0
1
|
|
| 0, 1, 2, 8, 9, 17, 46, 79, 180, 404, 882, 1946
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
J. O. M. Pedersen, Tables of aliquot cycles.
|
|
EXAMPLE
|
a(7)=46 because there are 46 betrothed pairs (m,n) with m<=10^7
|
|
MATHEMATICA
|
s[n_]:=DivisorSigma[1, n]-n; BetrothedNumberQ[n_]:=If[s[s[n]-1]==n+1 && n>1, True, False]; BetrothedPairList[k_]:=(anlist=Select[Range[k], BetrothedNumberQ[ # ] &]; prlist=Table[Sort[{anlist[[n]], s[anlist[[n]]]-1}], {n, 1, Length[anlist]}]; Union[prlist, prlist]); data=BetrothedPairList[10^6]; Table[Length[Select[data, First[ # ]<10^k &]], {k, 1, 6}]
|
|
CROSSREFS
|
Cf. A003502, A003503, A005276.
Sequence in context: A004999 A105125 A033492 this_sequence A118962 A096033 A073413
Adjacent sequences: A126157 A126158 A126159 this_sequence A126161 A126162 A126163
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Ant King (mathstutoring(AT)ntlworld.com), Dec 19 2006
|
|
|
Search completed in 0.002 seconds
|
