login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055875 a(0)=1, a(n) = prime(n^3). 20
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
A sequence of increments for Shell sort that produces good results. A bit better than Sedgewick's A036562 and A003462.
LINKS
David A. Corneth, Table of n, a(n) for n = 0..2200 (first 1001 terms from Ivan Panchenko)
Andrew Booker, Nth Prime Page.
FORMULA
a(n) = A000040(A000578(n)), n>0.
MATHEMATICA
{1}~Join~Array[Prime[#^3] &, 35] (* Michael De Vlieger, Apr 13 2021 *)
PROG
(Magma) [NthPrime(n^3): n in [0..50] ]; // Vincenzo Librandi, Apr 22 2011
(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
CROSSREFS
Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875.
Sequence in context: A107123 A360816 A193047 * A089659 A240124 A278405
KEYWORD
nonn
AUTHOR
Steven Pigeon (pigeon(AT)iro.umontreal.ca), Jul 14 2000
EXTENSIONS
More terms from Jonathan Vos Post, Aug 13 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 04:04 EDT 2024. Contains 371782 sequences. (Running on oeis4.)