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 A349937 #7 Dec 10 2021 11:15:40
%S A349937 315,525,693,765,825,945,1125,1155,1323,1395,1575,1683,1725,1755,1785,
%T A349937 1815,1845,1995,2205,2275,2277,2415,2457,2475,2535,2565,2691,2695,
%U A349937 2793,2805,2835,2907,3003,3045,3285,3315,3375,3465,3591,3645,3675,3705,3735,3825,3885
%N A349937 Odd numbers k > 1 such that A309906(k-1) < A309906(k) > A309906(k+1).
%C A349937 Conjecturally, odd numbers k > 1 such that liminf_{n->oo} d(p(n)^(k-1)-1) < liminf_{n->oo} d(p(n)^k-1) > liminf_{n->oo} d(p(n)^(k+1)-1), where p(n) = prime(n), d = A000005.
%C A349937 If k is odd, then A079612(k) = 2, so A309906(k) is usually smaller than either A309906(k-1) or A309906(k+1) (or both). This sequence lists the exceptions.
%e A349937 A309906(314) = 128 < A309906(315) = 8192 > A309906(316) = 2560, so 315 is a term.
%o A349937 (PARI) isA349937(k) = (k%2&&k>1) && A309906(k)>A309906(k-1) && A309906(k)>A309906(k+1) \\ See A309906 for its program
%Y A349937 Cf. A309906, A349938, A349941.
%K A349937 nonn
%O A349937 1,1
%A A349937 _Jianing Song_, Dec 05 2021