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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A252596 Let a(n-1)=p and k=pi(p); then a(n)=prime(k+mod(p,3)). 1
 5, 11, 17, 23, 31, 37, 41, 47, 59, 67, 71, 79, 83, 97, 101, 107, 113, 131, 139, 149, 157, 163, 167, 179, 191, 197, 211, 223, 227, 233, 241, 251, 263, 271, 277, 281, 293, 311, 317, 337, 347, 353, 367, 373, 379, 383, 397, 401, 419, 431, 439, 443, 457, 461, 467, 487, 491, 503, 521, 541, 547 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 FORMULA a(n+1) = prime(A049084(a(n)) + a(n) mod 3). - Reinhard Zumkeller, Dec 19 2014 MATHEMATICA a = 5; s = {5}; n = 3; Do[b = Prime[n = n + Mod[a, 3]]; AppendTo[s, b]; a = b, {100}]; s PROG (Haskell) a252596 n = a252596_list !! (n-1) a252596_list = iterate (\x -> a000040 (a049084 x + mod x 3)) 5 -- Reinhard Zumkeller, Dec 19 2014 CROSSREFS Cf. A000040, A049084. Sequence in context: A287305 A189938 A184525 * A096448 A351140 A365809 Adjacent sequences: A252593 A252594 A252595 * A252597 A252598 A252599 KEYWORD nonn AUTHOR Zak Seidov, Dec 19 2014 STATUS approved

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

Last modified September 19 01:02 EDT 2024. Contains 376002 sequences. (Running on oeis4.)