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 A055875 #41 Apr 03 2023 10:36:09
%S A055875 1,2,19,103,311,691,1321,2309,3671,5519,7919,10957,14753,19403,24809,
%T A055875 31319,38873,47657,57559,69031,81799,96137,112291,130073,149717,
%U A055875 171529,195043,220861,248851,279431,312583,347707,386093,427169,470933,517553
%N A055875 a(0)=1, a(n) = prime(n^3).
%C A055875 A sequence of increments for Shell sort that produces good results. A bit better than Sedgewick's A036562 and A003462.
%H A055875 David A. Corneth, <a href="/A055875/b055875.txt">Table of n, a(n) for n = 0..2200</a> (first 1001 terms from Ivan Panchenko)
%H A055875 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>
%H A055875 Andrew Booker, <a href="https://t5k.org/nthprime/index.php#n-th">Nth Prime Page</a>.
%F A055875 a(n) = A000040(A000578(n)), n>0.
%t A055875 {1}~Join~Array[Prime[#^3] &, 35] (* _Michael De Vlieger_, Apr 13 2021 *)
%o A055875 (Magma) [NthPrime(n^3): n in [0..50] ]; // _Vincenzo Librandi_, Apr 22 2011
%o A055875 (PARI) first(n) = { my(res = vector(n), t = 0); forprime(p = 2, oo, t++; if(ispower(t, 3, &i), print1([i, p]", "); res[i] = p; if(i >= n, return(concat(1, res))))) } \\ _David A. Corneth_, Apr 13 2021
%Y A055875 Cf. A033844, A036562, A003462, A036567, A036569, A055876.
%Y A055875 Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875.
%Y A055875 Cf. A011757, A109724.
%K A055875 nonn
%O A055875 0,2
%A A055875 Steven Pigeon (pigeon(AT)iro.umontreal.ca), Jul 14 2000
%E A055875 More terms from _Jonathan Vos Post_, Aug 13 2005