|
|
A212373
|
|
Numbers n such that A001065(x)*x = n has at least two solutions, where x is an abundant number.
|
|
3
|
|
|
141440, 2286080, 6680960, 1119849500, 2081125376, 3991520000, 4141021500, 9644638208, 23664804800, 32662630400, 37516855536, 67994319888, 577461690368, 618169892864, 627198842816, 4132702579824, 4949713492400, 5025386326400, 5579119296000, 9013476012156
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
Example: For n=141440, A001065(340)*340 = 141440, A001065(320)*320 = 141440, A001065(340) > 340, A001065(320) > 320, therefore 141440 is included in this sequence.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|