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 A050769 #14 Jul 23 2023 01:49:58
%S A050769 10,12,14,15,21,44,90,135,210,252,294,384,468,504,513,686,704,720,768,
%T A050769 832,864,972,1155,1368,1701,1890,2176,2184,2352,2400,2880,3080,3400,
%U A050769 3640,3888,4032,4536,4725,5200,6174,6384,8750,9548,10350,10400,10500
%N A050769 Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 2 skipped primes.
%H A050769 Harvey P. Dale, <a href="/A050769/b050769.txt">Table of n, a(n) for n = 0..333</a> (all terms up to 5*10^6)
%e A050769 a(6) = 44 + (2 + 2 + 11) = ending prime 59. Between 44 and 59 there are 2 primes: 47 and 53.
%t A050769 ckpgQ[n_]:=Module[{c=n+Total[Flatten[Table[#[[1]],{#[[2]]}]&/@ FactorInteger[ n]]]},CompositeQ[n]&&PrimeQ[c]&&PrimePi[c]-PrimePi[n] == 3]; Select[Range[11000],ckpgQ] (* _Harvey P. Dale_, Nov 29 2014 *)
%Y A050769 Cf. A050703, A050710.
%K A050769 nonn
%O A050769 0,1
%A A050769 _Patrick De Geest_, Sep 15 1999