|
Search: id:A096058
|
|
|
| A096058 |
|
a(1) = 1, a(n) = largest prime divisor of b(n), where b(1) = 1, b(n) = n*b(n-1) + 1 = A002627(n). |
|
+0
4
|
|
| 1, 3, 5, 41, 103, 1237, 433, 2389, 2711, 145007, 523, 164611949, 232603841, 201069629, 132267077, 35951249665217, 204405098431, 392881768421, 52255141388393, 8098687, 43894318766250120011, 386270005143001056097
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Equals A006530(A002627(n)).
|
|
EXAMPLE
|
a(4) = 41 because b(3) = 3*b(2)+1 = 3*3+1 = 10 and 4*10+1 = 41, which is prime.
b(n) = 1, 3, 10, 41, ... with largest prime divisors a(n) = 1, 3, 5, 41, ...
|
|
CROSSREFS
|
Cf. A096057.
Cf. A006530, A002627, A096057.
Sequence in context: A077779 A146318 A145912 this_sequence A120265 A158328 A062633
Adjacent sequences: A096055 A096056 A096057 this_sequence A096059 A096060 A096061
|
|
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
|
