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 A233671 #7 Dec 09 2021 17:25:15 %S A233671 2,4,6,8,9,11,14,15,18,21,23,24,27,29,30,32,34,36,39,42,44,46,50,51, %T A233671 53,58,61,62,65,66,68,70,71,72,76,77,79,80,82,84,86,87,90,91,94,96,97, %U A233671 99,101,105,106,110,114,117,118,121,123,124,125,127,132,135 %N A233671 Numbers k such that prime(k)^2 < prime(k-1)*prime(k+1). %C A233671 If 1 is appended to A046868, the resulting sequence is the complement of A233671. Does A233671 have asymptotic density 1/2? Does every positive integer occur infinitely many times in the difference sequence of A233671? %H A233671 Clark Kimberling, <a href="/A233671/b233671.txt">Table of n, a(n) for n = 1..10000</a> %e A233671 a(1) = 2 because 3^2 < 2*5. %t A233671 Select[Range[2, 200], Prime[#]^2 < Prime[# - 1]*Prime[# + 1] &] %t A233671 PrimePi[#]&/@Select[Partition[Prime[Range[200]],3,1],#[[2]]^2<(#[[1]] #[[3]])&][[All,2]] (* _Harvey P. Dale_, Dec 09 2021 *) %Y A233671 Cf. A046868, A000040. %K A233671 nonn,easy %O A233671 1,1 %A A233671 _Clark Kimberling_, Dec 14 2013