|
Search: id:A090523
|
|
|
| A090523 |
|
Smallest prime p such that floor[n!/p] is prime, or 0 if no such prime exists. |
|
+0
2
|
|
| 2, 7, 7, 19, 29, 17, 107, 29, 151, 67, 101, 31, 43, 163, 59, 31, 41, 173, 79, 167, 73, 233, 107, 73, 29, 43, 1259, 89, 317, 191, 349, 541, 199, 173, 577, 89, 373, 997, 197, 773, 1093, 257, 1733, 487, 349, 149, 1511, 2621, 389, 181, 151
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
Conjecture: No term is zero.
|
|
MATHEMATICA
|
Do[p = 1; While[ !PrimeQ[Floor[n!/Prime[p]]], p++ ]; Print[Prime[p]], {n, 3, 30}] (Propper)
|
|
CROSSREFS
|
Cf. A090524.
Adjacent sequences: A090520 A090521 A090522 this_sequence A090524 A090525 A090526
Sequence in context: A003061 A087385 A090521 this_sequence A011416 A086658 A011053
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 07 2003
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Jun 23 2005
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 07 2007
|
|
|
Search completed in 0.002 seconds
|
