|
Search: id:A090958
|
|
|
| A090958 |
|
Numbers in increasing order so that the least multiple of prime(n) in the sequence is primorial(n). |
|
+0
2
|
|
| 1, 2, 4, 6, 8, 9, 12, 16, 18, 24, 27, 30, 32, 36, 40, 45, 48, 50, 54, 60, 64, 72, 75, 80, 81, 90, 96, 100, 108, 120, 125, 128, 135, 144, 150, 160, 162, 180, 192, 200, 210, 216, 224, 225, 240, 243, 245, 250, 252, 256, 270, 280, 288, 294, 300, 315, 320, 324, 336, 343
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
The sequence is obtained by including all those numbers between Primorial(n) and primorial(n+1) which have the largest prime divisor < = prime(n).
|
|
PROGRAM
|
(PARI) v = vector(1000); pr = 1; forprime(p = 2, 1000, pr *= p; v[p] = pr); for (n = 2, 1000, f = factor(n); p = f[matsize(f)[1], 1]; if (n >= v[p], print(n))); - David Wasserman (wasserma(AT)spawar.navy.mil), Feb 22 2006
|
|
CROSSREFS
|
Cf. A090959.
Sequence in context: A100345 A118363 A146982 this_sequence A074901 A125990 A080223
Adjacent sequences: A090955 A090956 A090957 this_sequence A090959 A090960 A090961
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 31 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Feb 22 2006
|
|
|
Search completed in 0.002 seconds
|
