|
Search: id:A076083
|
|
|
| A076083 |
|
Consider all composite numbers between prime(n) and prime(n+1); take those with smallest number of divisors; a(n) is the smallest of them. |
|
+0
3
|
|
| 4, 6, 9, 12, 14, 18, 21, 25, 30, 33, 38, 42, 46, 49, 55, 60, 62, 69, 72, 74, 82, 85, 91, 98, 102, 106, 108, 111, 121, 129, 133, 138, 141, 150, 155, 158, 166, 169, 177, 180, 183, 192, 194, 198, 201, 213, 226, 228, 230, 235, 240, 247, 253, 259, 265, 270, 274, 278
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
PROGRAM
|
(PARI) for(n=2, 100, m=99999:r=0:for(k=prime(n)+1, prime(n+1)-1, if(!isprime(k), if(numdiv(k)<m, r=k:m=numdiv(k)))):print1(r", "))
|
|
CROSSREFS
|
Cf. A076082.
Sequence in context: A047408 A060644 A122550 this_sequence A094202 A007074 A054087
Adjacent sequences: A076080 A076081 A076082 this_sequence A076084 A076085 A076086
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 07 2002
|
|
EXTENSIONS
|
More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 23 2003
|
|
|
Search completed in 0.002 seconds
|
