|
Search: id:A120762
|
|
|
| A120762 |
|
a(1) = 2. a(n) = a(n-1)*(largest prime occurring earlier in the sequence) + 1. |
|
+0
2
|
|
| 2, 5, 26, 131, 17162, 2248223, 5054506657730, 11363658121561713791, 25548037553031840864343394, 57437685631589904363556698288863, 129132725903709949557948530897082440450
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
Among the first 3 terms of the sequence, 5 is the largest prime. So a(4) = a(3)*5 +1 = 26*5 + 1 = 131.
|
|
PROGRAM
|
(PARI) {m=11; print1(a=2, ", "); v=[a]; for(n=2, m, b=a; v=vecsort(v); j=#v; a=0; while(a<1, k=v[j]; if(isprime(k), print1(a=b*k+1, ", "); v=concat(v, a), j--)))} - (Klaus Brockhaus, Aug 17 2006)
|
|
CROSSREFS
|
Cf. A120763.
Sequence in context: A019047 A045903 A090878 this_sequence A072268 A019014 A128595
Adjacent sequences: A120759 A120760 A120761 this_sequence A120763 A120764 A120765
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jul 03 2006
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 17 2006
|
|
|
Search completed in 0.002 seconds
|
