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 A256476 #9 Mar 30 2015 21:42:18 %S A256476 2,3,4,5,6,7,8,9,11,12,15,16,18,19,21,22,23,24,27,28,29,30,31,32,33, %T A256476 34,35,36,37,40,46,47,51,52,53,54,56,57,60,62,64,66,67,68,70,71,72,75, %U A256476 76,78,79,80,82,83,84,85,87,89,91,93,94,95,97,99,100,102,104,105,111,112,113,114,115,118,119,123 %N A256476 Numbers n for which there are more primes in range [prime(n)*prime(n+1), prime(n+1)^2] than in range [prime(n)^2, prime(n)*prime(n+1)]. %C A256476 Positions where A256470 is strictly positive. %H A256476 Antti Karttunen, <a href="/A256476/b256476.txt">Table of n, a(n) for n = 1..3413</a> %t A256476 Select[Range@125, Count[Range[Prime[#] Prime[# + 1], Prime[# + 1]^2], _?PrimeQ] > Count[Range[Prime[#]^2, Prime[#] Prime[# + 1]], _?PrimeQ] &] (* _Michael De Vlieger_, Mar 30 2015 *) %o A256476 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A256476 (define A256476 (MATCHING-POS 1 1 (lambda (n) (< 0 (A256470 n))))) %Y A256476 Complement: A256477. %Y A256476 Setwise difference of A256474 and A256471. %Y A256476 Cf. A256470. %K A256476 nonn %O A256476 1,1 %A A256476 _Antti Karttunen_, Mar 30 2015