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 A300097 #14 Feb 27 2018 05:31:08
%S A300097 5,7,11,17,23,29,37,53,59,67,79,89,97,127,191,211,223,307,331,479,521,
%T A300097 541,809,877,907,1087,1277,1361,1931,2179,2203,2999,3299,4201,4327,
%U A300097 4861,5779,7993,8923,12889,14143,15859,16411,16603,18839,19661,24317,25523,28277
%N A300097 Primes for which A288814 gives a new record.
%C A300097 These are the primes that require the most effort when searching for the least composite c such that A001414(c) is a given prime, where A001414 is sopfr (sum of prime factors with repetition).
%C A300097 From _David James Sycamore_, Feb 25 2018: (Start)
%C A300097 Also primes for which A295185 gives a new record.
%C A300097 A006512 gives primes p requiring least effort, since then c=2*(p-2). (End)
%o A300097 (PARI) isok(k, n) = my(f=factor(k)); sum(j=1, #f~, f[j, 1]*f[j, 2]) == n;
%o A300097 scompo(n) = forcomposite(k=4, ,if (isok(k, n), return(k)));
%o A300097 lista(nn) = {my(last = 0); forprime(p=4, nn, my(val = scompo(p)); if (val > last, print1(p, ", "); last = val););}
%Y A300097 Cf. A001414, A006512, A288814, A295185, A300098.
%K A300097 nonn
%O A300097 1,1
%A A300097 _Michel Marcus_, Feb 24 2018