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 A147813 #16 Nov 02 2013 03:00:47 %S A147813 2,3,5,11,17,19,29,41,43,47,59,71,79,83,101,107,109,127,137,149,151, %T A147813 163,167,179,191,197,199,227,229,239,251,257,269,281,283,311,313,331, %U A147813 347,349,353,367,379,383,397,401,419,431,439,443,461,463,487,499,503,521 %N A147813 Primes prime(n) such that (-prime(n) + 2*prime(n+1) - prime(n+2))/((1 - prime(n) + prime(n+1))^(3/2)) < 0. %H A147813 Reinhard Zumkeller, <a href="/A147813/b147813.txt">Table of n, a(n) for n = 1..10000</a> %F A147813 Primes prime(n) such that (-prime(n) + 2*prime(n+1) - prime(n+2))/((1 - prime(n) + prime(n+1))^(3/2)) < 0. %t A147813 d2[n_] = Prime[n + 2] - 2*Prime[n + 1] + Prime[n]; d1[n_] = Prime[n + 1] - Prime[n]; k[n_] = -d2[n]/(1 + d1[n])^(3/2); Flatten[Table[If[k[n]<= 0, Prime[n], {}], {n, 1, 100}]] %o A147813 (Haskell) %o A147813 import Data.List (findIndices) %o A147813 a147813 n = a147813_list !! (n-1) %o A147813 a147813_list = map (a000040 . (+ 1)) $ findIndices (>= 0) a036263_list %o A147813 -- _Reinhard Zumkeller_, Jan 20 2012 %Y A147813 Cf. A036263, A147812 (complement with respect to A000040). %K A147813 nonn %O A147813 1,1 %A A147813 _Roger L. Bagula_, Nov 13 2008 %E A147813 Edited by _Alonso del Arte_ and _Joerg Arndt_, Nov 01 2013