login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113161 a(1) = 1, a(n+1) = largest prime <= a(n)+n. 0
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; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..55.

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 *)

PROG

(PARI) {print1(a=1, ", "); for(n=2, 55, print1(a=precprime(a+n-1), ", "))} - (Brockhaus)

CROSSREFS

Cf. A093503.

Sequence in context: A175953 A040089 A267944 * A038953 A237288 A293074

Adjacent sequences:  A113158 A113159 A113160 * A113162 A113163 A113164

KEYWORD

nonn

AUTHOR

Leroy Quet, Jan 05 2006

EXTENSIONS

More terms from Klaus Brockhaus and Robert G. Wilson v, Jan 06 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 16:37 EDT 2022. Contains 354119 sequences. (Running on oeis4.)