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 A182011 #17 Jul 29 2024 17:21:10
%S A182011 6,2,3,21,5,55,7,33,22,39,11,85,13,51,34,57,17,115,19,69,46,203,23,
%T A182011 145,1295,87,58,93,29,259,31,185,615,111,74,205,37,123,82,129,41,235,
%U A182011 43,141,94,371,47,265,1239,159,106,413,53,295,2345,177,118,183,59,469
%N A182011 a(n) is the smallest number k such that the difference between the greatest prime divisor of k and the sum of the other distinct prime divisors equals n.
%C A182011 a(n) = n if n is prime.
%H A182011 Alois P. Heinz, <a href="/A182011/b182011.txt">Table of n, a(n) for n = 1..1000</a>
%e A182011 a(1) = 6 because 6 = 2*3 and 3 - 2 = 1.
%t A182011 dgpd[n_]:=With[{fi=FactorInteger[n][[;;,1]]},fi[[-1]]-Total[Most[fi]]]; Join[{6},With[{tbl=Table[ {n,dgpd[n]},{n,2500}]},Table[SelectFirst[tbl,#[[2]]==k&],{k,2,60}]][[;;,1]]] (* _Harvey P. Dale_, Jul 29 2024 *)
%Y A182011 Cf. A001221.
%K A182011 nonn
%O A182011 1,1
%A A182011 _Michel Lagneau_, Apr 09 2012