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 A130871 #13 Jun 24 2019 04:17:58
%S A130871 15,35,44,54,90,95,119,143,209,287,319,323,328,351,377,390,423,527,
%T A130871 559,608,779,899,923,924,989,1007,1189,1199,1280,1343,1349,1715,1763,
%U A130871 1805,1825,1919,2000,2159,2448,2507,2755,2759,2847,2911,3008
%N A130871 Numbers k such that the sum of the prime factors with multiplicity of k divides k+1.
%H A130871 Amiram Eldar, <a href="/A130871/b130871.txt">Table of n, a(n) for n = 1..10000</a>
%F A130871 List the factors of n with multiplicity to see if their sum divides the following number n+1.
%e A130871 90=2*3*3*5 with sum 2+3+3+5=13, 7*13=91, so 90 is in the sequence.
%t A130871 Select[Range[2, 10000], IntegerQ[(# + 1)/Sum[FactorInteger[ # ][[i,1]] *FactorInteger[ # ][[i, 2]], {i, 1, Length[FactorInteger[ # ]]}]] &] (* _Stefan Steinerberger_, Jul 26 2007 *)
%Y A130871 Cf. A001414, A036844.
%K A130871 easy,nonn
%O A130871 1,1
%A A130871 _J. M. Bergot_, Jul 24 2007
%E A130871 Corrected and extended by _Stefan Steinerberger_, Jul 26 2007