The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Cf. A212327, A005101, A212489, A212490. Sequence in context: A252017 A203833 A032747 * A195438 A164527 A214479 Adjacent sequences:  A212370 A212371 A212372 * A212374 A212375 A212376 KEYWORD nonn AUTHOR Naohiro Nomoto, May 18 2012 EXTENSIONS a(9)-a(20) from Donovan Johnson, May 21 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 2 08:16 EDT 2020. Contains 334767 sequences. (Running on oeis4.)