|
Search: id:A096057
|
|
|
| A096057 |
|
a(1) = 1, a(n) = least prime divisor of b(n), where b(1) = 1, b(n) = n*b(n-1) + 1 = A002627(n). |
|
+0
2
|
|
| 1, 3, 2, 41, 2, 1237, 2, 29, 2, 43, 2, 5, 2, 5, 2, 35951249665217, 2, 28001, 2, 1409, 2, 5, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(4) = 41 because b(3) = 3*b(2)+1 = 3*3+1 = 10 and 4*10+1 = 41, which is prime.
|
|
FORMULA
|
Equals A020639(A002627(n)).
|
|
EXAMPLE
|
b(n) = 1, 3, 10, 41, ... with least prime divisors a(n) = 1, 3, 2, 41, ....
|
|
CROSSREFS
|
Cf. A096058.
Cf. A020639, A002627, A096058.
Sequence in context: A062743 A013324 A009084 this_sequence A065085 A093398 A002680
Adjacent sequences: A096054 A096055 A096056 this_sequence A096058 A096059 A096060
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 17 2004
|
|
EXTENSIONS
|
Corrected and extended by Ray G. Opao (1260(AT)email.com), Aug 02 2004
Edited by Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Jan 09 2005
|
|
|
Search completed in 0.002 seconds
|
