|
Search: id:A096225
|
|
|
| A096225 |
|
a(0) = 1; for n >= 0, a(n+1) = smallest prime factor of a(n)! + 1. |
|
+0
3
|
| |
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
71!+1 is the product of 6653 and a large prime.
|
|
MATHEMATICA
|
a[1] = 2; a[n_] := Block[{p = PrimePi[a[n - 1]] + 1, r = a[n - 1]! + 1}, While[ Mod[r, Prime[p]] != 0, p++ ]; Prime[p]]; Do[ Print[ a[n]], {n, 7}] (from Robert G. Wilson v Aug 12 2004)
|
|
CROSSREFS
|
Cf. A002583, A051301.
Adjacent sequences: A096222 A096223 A096224 this_sequence A096226 A096227 A096228
Sequence in context: A090870 A088542 A075840 this_sequence A035094 A084729 A101117
|
|
KEYWORD
|
nonn,more,hard,nice
|
|
AUTHOR
|
njas, Aug 09 2004
|
|
EXTENSIONS
|
a(6) and a(7) from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 12 2004
|
|
|
Search completed in 0.002 seconds
|
