cp's OEIS Frontend

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.

A055875 a(0)=1, a(n) = prime(n^3).

Original entry on oeis.org

1, 2, 19, 103, 311, 691, 1321, 2309, 3671, 5519, 7919, 10957, 14753, 19403, 24809, 31319, 38873, 47657, 57559, 69031, 81799, 96137, 112291, 130073, 149717, 171529, 195043, 220861, 248851, 279431, 312583, 347707, 386093, 427169, 470933, 517553
Offset: 0

Views

Author

Steven Pigeon (pigeon(AT)iro.umontreal.ca), Jul 14 2000

Keywords

Comments

A sequence of increments for Shell sort that produces good results. A bit better than Sedgewick's A036562 and A003462.

Crossrefs

Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875.

Programs

  • Magma
    [NthPrime(n^3): n in [0..50] ]; // Vincenzo Librandi, Apr 22 2011
    
  • Mathematica
    {1}~Join~Array[Prime[#^3] &, 35] (* Michael De Vlieger, Apr 13 2021 *)
  • 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

Formula

a(n) = A000040(A000578(n)), n>0.

Extensions

More terms from Jonathan Vos Post, Aug 13 2005