|
Search: id:A113161
|
|
|
| A113161 |
|
a(1) = 1, a(n+1) = largest prime <= a(n)+n. |
|
+0
1
|
|
| 1, 2, 3, 5, 7, 11, 17, 23, 31, 37, 47, 53, 61, 73, 83, 97, 113, 127, 139, 157, 173, 193, 211, 233, 257, 281, 307, 331, 359, 383, 409, 439, 467, 499, 523, 557, 593, 619, 653, 691, 727, 761, 797, 839, 883, 919, 953, 997, 1039, 1087, 1129, 1171, 1223, 1259, 1307
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
a(7) = 17. So a(8) = the largest prime <= 17 + 7 = 24, which is 23.
|
|
MATHEMATICA
|
PrevPrim[n_] := Block[{k = n - 1}, While[ !PrimeQ[k], k-- ]; k]; a[1] = 1; a[n_] := a[n] = PrevPrim[a[n - 1] + n]; Array[a, 55] (* Robert G. Wilson v *)
|
|
PROGRAM
|
(PARI) {print1(a=1, ", "); for(n=2, 55, print1(a=precprime(a+n-1), ", "))} - (Brockhaus)
|
|
CROSSREFS
|
Cf. A093503.
Sequence in context: A075551 A070866 A040089 this_sequence A038953 A005105 A086566
Adjacent sequences: A113158 A113159 A113160 this_sequence A113162 A113163 A113164
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Jan 05 2006
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Robert G. Wilson v (rgwv(at)rgwv.com), Jan 06 2006
|
|
|
Search completed in 0.002 seconds
|
