This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A212489 #12 May 22 2012 02:48:29 %S A212489 1245335,318047135,358491735,533718135,709131500,1122571695, %T A212489 1814416175,3565970135,4486354631,14336906175,14827262351,22805269551, %U A212489 36360557831,43971297884,72370166375,99254203895,102204949847,145262865020,156161459559,173741271935,231267964895 %N A212489 Numbers n such that A001065(x)*x = n has at least two solutions, where x is a deficient number. %e A212489 Example: For n=1245335, A001065(1955)*1955 = 1245335, A001065(2093)*2093 = 1245335, A001065(1955) < 1955, A001065(2093) < 2093, therefore 1245335 is included in this sequence. %Y A212489 Cf. A005100, A212490, A212373, A212327. %K A212489 nonn %O A212489 1,1 %A A212489 _Naohiro Nomoto_, May 18 2012 %E A212489 a(6)-a(21) from _Donovan Johnson_, May 21 2012