|
| |
|
|
A073071
|
|
Least k such that k! > prime(1)*prime(2)*...*prime(n) where prime(n) is the n-th prime.
|
|
7
| |
|
|
3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 16, 17, 19, 20, 21, 23, 24, 25, 27, 28, 29, 31, 32, 33, 34, 36, 37, 38, 40, 41, 42, 44, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 58, 59, 60, 62, 63, 64, 66, 67, 68, 70, 71, 72, 73, 75, 76, 77, 79, 80, 81, 83, 84, 85, 86, 88, 89
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| If the greater than sign in the definition is replaced by >=, we get A048964. - R. J. Mathar, May 01 2008
|
|
|
LINKS
| David Wilson, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
| a(n) should be asymptotic to C*n (where 1<C<3/2).
|
|
|
EXAMPLE
| n=1: prime(1) = 2, 3! > 2, a(1) = 3.
n=2: prime(1)*prime(2) = 6, 4! > 6, a(2) = 4.
|
|
|
CROSSREFS
| Cf. A135667, A048964.
Sequence in context: A077656 A039236 A039180 * A039134 A097901 A026423
Adjacent sequences: A073068 A073069 A073070 * A073072 A073073 A073074
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 17 2002
|
|
|
EXTENSIONS
| Corrected by Peter Pein (petsie(AT)dordos.net), May 01 2008
|
| |
|
|
