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 A256474 #12 Mar 31 2015 00:28:29 %S A256474 1,2,3,4,5,6,7,8,9,10,11,12,14,15,16,17,18,19,20,21,22,23,24,27,28,29, %T A256474 30,31,32,33,34,35,36,37,40,46,47,51,52,53,54,56,57,60,62,64,66,67,68, %U A256474 70,71,72,75,76,78,79,80,82,83,84,85,87,89,90,91,93,94,95,97,99,100 %N A256474 Numbers n for which there are at least as many primes in the range [prime(n)*prime(n+1), prime(n+1)^2] as in the range [prime(n)^2, prime(n)*prime(n+1)]. %C A256474 Positions of nonnegative terms in A256470. %H A256474 Antti Karttunen, <a href="/A256474/b256474.txt">Table of n, a(n) for n = 1..3457</a> %t A256474 Select[Range@100, Count[Range[Prime[#] Prime[# + 1], Prime[# + 1]^2], _?PrimeQ] >= Count[Range[Prime[#]^2, Prime[#] Prime[# + 1]], _?PrimeQ] &] (* _Michael De Vlieger_, Mar 30 2015 *) %o A256474 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A256474 (define A256474 (MATCHING-POS 1 1 (lambda (n) (<= 0 (A256470 n))))) %Y A256474 Complement: A256475. %Y A256474 Union of A256471 and A256476. %Y A256474 Cf. A256484 (corresponding primes). %Y A256474 Cf. A256470. %K A256474 nonn %O A256474 1,2 %A A256474 _Antti Karttunen_, Mar 30 2015