|
| |
|
|
A087998
|
|
a(n)=Min{x; sigma[x]=2x+2n}.
|
|
3
| |
|
|
6, 20, 12, 8925, 56, 40, 24, 272, 550, 208, 176, 1312, 112, 80, 48, 945, 572, 928, 2205, 5696, 736, 9555, 350, 490, 60, 416, 352, 90, 84, 160, 96, 24704, 108, 3904, 260, 487936, 132, 1575, 340, 234, 156, 22144, 2752, 2624, 460, 306, 500, 475678, 204
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| The satellite problem: sigma[x]=2x+odd seems much more difficult. Solutions[square or 2.square! ] I got only for 3,7,17,19,31,39,41,51,59,65,71, 89,115,119,127,161,185,199.
|
|
|
EXAMPLE
| n=67: 2n=134, first solution to sigma[x]=2x+134
is a(67)=1958912;
n=0: solution is the least perfect number, a(0)=6;
2n=12, 2n=56 provide large number of solutions.
|
|
|
MATHEMATICA
| ds[x_, de_] := DivisorSigma[1, x]-2*x-de a[n_] := Block[{m=1, s=ds[m, n]}, While[(s !=0)&& !Greater[m, 10000000], m++ ]; m]; Table[a[n], {n, 1, 100}]//Timing
|
|
|
CROSSREFS
| Sequence in context: A075251 A090590 A002566 * A096823 A007253 A096897
Adjacent sequences: A087995 A087996 A087997 * A087999 A088000 A088001
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Oct 13 2003
|
| |
|
|
