|
|
A037155
|
|
a(n) = n!-p, where p is the largest prime < (n!-1).
|
|
6
|
|
|
3, 5, 7, 11, 17, 31, 13, 11, 13, 13, 23, 17, 47, 53, 59, 41, 101, 31, 31, 73, 89, 73, 149, 37, 43, 101, 31, 79, 61, 163, 47, 193, 113, 127, 97, 79, 73, 83, 131, 79, 109, 109, 53, 89, 79, 103, 59, 97, 179, 67, 59, 127, 61, 461, 277, 109, 137, 139, 71, 71, 101, 359
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
Analogous to the lesser Fortunate numbers and like them, all entries so far are primes.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(4) = 4!-19 = 24-19 = 5.
|
|
MATHEMATICA
|
PrevPrime[ n_Integer ] := (k=n-1; While[ !PrimeQ[ k ], k-- ]; Return[ k ]); f[ n_Integer ] := (p = n! - 1; q = NextPrime[ p ]; Return[ p - q + 1 ]); Table[ f[ n ], {n, 3, 75} ]
f[n_]:=Module[{nf=n!}, nf-NextPrime[nf-1, -1]]; f/@Range[3, 90] (* Harvey P. Dale, Mar 20 2011 *)
|
|
PROG
|
(Python)
from sympy import factorial, prevprime
def a(n): fn = factorial(n); return fn - prevprime(fn-1)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|