|
%I #9 Dec 19 2014 16:42:02
%S 5,11,17,23,31,37,41,47,59,67,71,79,83,97,101,107,113,131,139,149,157,
%T 163,167,179,191,197,211,223,227,233,241,251,263,271,277,281,293,311,
%U 317,337,347,353,367,373,379,383,397,401,419,431,439,443,457,461,467,487,491,503,521,541,547
%N Let a(n-1)=p and k=pi(p); then a(n)=prime(k+mod(p,3)).
%H Reinhard Zumkeller, <a href="/A252596/b252596.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n+1) = prime(A049084(a(n)) + a(n) mod 3). - _Reinhard Zumkeller_, Dec 19 2014
%t a = 5; s = {5}; n = 3; Do[b = Prime[n = n + Mod[a, 3]]; AppendTo[s, b]; a = b, {100}]; s
%o (Haskell)
%o a252596 n = a252596_list !! (n-1)
%o a252596_list = iterate (\x -> a000040 (a049084 x + mod x 3)) 5
%o -- _Reinhard Zumkeller_, Dec 19 2014
%Y Cf. A000040, A049084.
%K nonn
%O 1,1
%A _Zak Seidov_, Dec 19 2014
|
