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 A317743 #29 Sep 23 2018 01:59:15
%S A317743 14,18,20,27,30,32,35,38,42,44,51,54,57,59,62,67,68,72,74,80,87,90,93,
%T A317743 98,102,104,110,114,123,128,131,132,135,138,140,143,147,150,152,158,
%U A317743 163,164,171,174,179,182,187,192,194,198,200
%N A317743 Valleys in A064800: terms which are smaller than their neighbors.
%C A317743 From _Zak Seidov_, Sep 21 2018: (Start)
%C A317743 First second-order valley is a(514) = 516
%C A317743 with {521, 517, 516, 517, 520}.
%C A317743 First third-order valley is a(k=265827) = 265829
%C A317743 with {265833, 265831, 265830, 265829, 265831, 265832, 265834}.
%C A317743 Are there minima of higher order? (End)
%e A317743 a(1) = 14 is the first valley (local minimum) in A064800 as A064800(13) = 14 is less than A064800(12) = 15 and A064800(14) = 16.
%t A317743 Transpose[ Select[ Partition[(# + PrimeOmega[#]) & /@ Range[201], 3, 1], #[[1]] > #[[2]] < #[[3]] &]][[2]] (* _Giovanni Resta_, Aug 09 2018 *)
%o A317743 (PARI) lista(nn) = {my(v = vector(nn, n, n + bigomega(n))); for (n=2, nn, if ((v[n] < v[n-1]) && (v[n] < v[n+1]), print1(v[n], ", ")););} \\ _Michel Marcus_, Sep 07 2018
%Y A317743 Cf. A064800, A319504.
%K A317743 nonn
%O A317743 1,1
%A A317743 _Zak Seidov_, Aug 05 2018