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 A287238 #16 Sep 04 2022 20:39:54
%S A287238 118315669766,130863307526,181448867234,184661404346,184881064994,
%T A287238 185180602238,186803095538,187013065238,187127594162,187516992482,
%U A287238 187889460398,188332874498,188587837538,188750086706,189131019338,189322730354,189374121386,189621107138
%N A287238 Numbers whose sum of proper divisors is equal to 95186291194.
%C A287238 The number 95186291194 is the 46th element of A283157. That is, no even number below it has more preimages under the sum-of-proper-divisors function.
%C A287238 There are exactly 112 elements in the sequence.
%C A287238 In 2016, C. Pomerance proved that, for every e>0, the number of preimages is O_e(n^{2/3+e}).
%C A287238 Conjecture: there exists a positive real number k > 1 such that the number of preimages of an even number n is O((log n)^k).
%H A287238 Anton Mosunov, <a href="/A287238/b287238.txt">Table of n, a(n) for n = 1..112</a>
%H A287238 C. Pomerance, <a href="https://math.dartmouth.edu/~carlp/aliquot.pdf">The first function and its iterates</a>, A Celebration of the Work of R. L. Graham, S. Butler, J. Cooper, and G. Hurlbert, eds., Cambridge U. Press, to appear.
%e A287238 a(1) = 118315669766, because it is the smallest number whose sum of proper divisors is equal to 95186291194: 1 + 2 + 7 + 14 + 19 + 38 + 133 + 266 + 444795751 + 889591502 + 3113570257 + 6227140514 + 8451119269 + 16902238538 + 59157834883 = 95186291194.
%Y A287238 Cf. A001065, A283156, A283157, A287233, A287247, A287251, A287262.
%K A287238 fini,full,nonn
%O A287238 1,1
%A A287238 _Anton Mosunov_, May 22 2017