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 A365767 #8 Mar 28 2025 02:10:48 %S A365767 5,21,38,149,110,329,226,575,1250,521,1966,1656,939,2127,3830,4665, %T A365767 1768,5883,4535,2387,8007,5968,9965,15293,8508,4457,9513,4974,10458, %U A365767 42153,13671,21959,7750,41767,9007,28180,30226,21322,33813,35899,12506,66241,14003,28809,14848,94735 %N A365767 a(n) is the number of primes between (prime(n))^3 and (prime(n+1))^3. %F A365767 a(n) = A038098(A000040(n+1)) - A038098(A000040(n)). %e A365767 a(2) = 21 because there are 21 primes between prime(2)^3 = 27 and prime(3)^3 = 125. %p A365767 A:= [seq(numtheory:-pi(ithprime(i)^3),i=1..30)]: %p A365767 A[2..-1] - A[1..-2]; %Y A365767 First differences of A086688. %Y A365767 Cf. A038098, A050216. %K A365767 nonn %O A365767 1,1 %A A365767 _Zak Seidov_ and _Robert Israel_, Sep 18 2023