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 A256470 #13 Mar 30 2015 21:41:56 %S A256470 0,1,2,3,1,6,1,3,3,0,3,2,-2,0,4,6,0,4,4,0,2,3,10,13,-1,-2,3,4,4,34,5, %T A256470 3,5,17,6,2,8,-2,-6,3,-4,-4,-3,-2,-1,9,25,-2,-6,-4,12,4,6,9,-6,18,1, %U A256470 -2,-11,7,-8,27,-10,3,-1,12,11,13,-3,5,3,5,-13,-8,10,16,-4,14,3,12,-3,23,5,4,6,-8,19,-13,1,0 %N A256470 a(n) = A256469(n) - A256468(n). %C A256470 a(n) = Difference between the number of primes occurring in range [prime(n)*prime(n+1), prime(n+1)^2] and the number of primes occurring in range [prime(n)^2, prime(n)*prime(n+1)]. %C A256470 In other words, a(n) tells how many more primes there are in the latter part of the range prime(n)^2 .. prime(n+1)^2 (after the geometric mean of its limits), than in its first part (before the geometric mean of its limits). %H A256470 Antti Karttunen, <a href="/A256470/b256470.txt">Table of n, a(n) for n = 1..6541</a> %H A256470 A. Karttunen, <a href="https://oeis.org/plot2a?name1=A256470&name2=A050216&tform1=untransformed&tform2=untransformed&shift=0&radiop1=matp&drawlines=true">Sequences A256470 and A050216 compared with OEIS Plot2-script</a> (See also the ratio-plots linked in A256468.) %F A256470 a(n) = A256469(n) - A256468(n). %F A256470 a(n) = 3 - A256449(n). %o A256470 (Scheme) (define (A256470 n) (- (A256469 n) (A256468 n))) %Y A256470 Positions of zeros: A256471. Cf. also A256472, A256473. %Y A256470 Positions of nonnegative terms: A256474, negative terms: A256475. %Y A256470 Positions of strictly positive terms: A256476, terms less than or equal to zero: A256477. %Y A256470 Cf. A256449, A256468, A256469. %K A256470 sign %O A256470 1,3 %A A256470 _Antti Karttunen_, Mar 30 2015