login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Numbers n such that A001065(x)*x = n has at least two solutions, where x is an abundant number.
3

%I #15 May 22 2012 02:48:16

%S 141440,2286080,6680960,1119849500,2081125376,3991520000,4141021500,

%T 9644638208,23664804800,32662630400,37516855536,67994319888,

%U 577461690368,618169892864,627198842816,4132702579824,4949713492400,5025386326400,5579119296000,9013476012156

%N Numbers n such that A001065(x)*x = n has at least two solutions, where x is an abundant number.

%e 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.

%Y Cf. A212327, A005101, A212489, A212490.

%K nonn

%O 1,1

%A _Naohiro Nomoto_, May 18 2012

%E a(9)-a(20) from _Donovan Johnson_, May 21 2012