%I A159559
%S A159559 3,5,6,7,8,11,12,14,15,17,18,19,20,21,22,23,24,29,30,32,33,37,38,39,40,
%T A159559 42,44,47,48,53,54,55,56,57,58,59,60,62,63,67,68,71,72,74,75,79,80,81,
%U A159559 82,84,85,89,90,91,92,93,94,97,98,101,102,104,105,106,108,109,110,111
%N A159559 Minimal increasing recursive sequence beginning with 3 which is similar 
               to A000027\{1} with respect to property of an integer: to be or not 
               to be prime
%C A159559 a(n) is prime iff n is prime.
%H A159559 Charles Greathouse, <a href="b159559.txt">Table of n, a(n) for n = 2..10000</
               a>
%H A159559 V. Shevelev, <a href="http://arXiv.org/abs/0904.2101">Several results 
               on sequences which are similar to the positive integers</a>
%F A159559 a(n+1)=min{m>a(n), m is prime},if n+1 is prime; otherwise, a(n+1)=min{m>
               a(n),m is composite}.
%p A159559 A159559 := proc(n) option remember; if n = 2 then 3; else for a from 
               procname(n-1)+1 do if isprime(n) and isprime(a) then RETURN(a) ; 
               elif not isprime(n) and not isprime(a) then RETURN(a) ; fi; od: fi; 
               end: seq(A159559(n),n=2..100) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Jul 28 2009]
%Y A159559 Sequence in context: A079253 A076054 A139636 this_sequence A047583 A010906 
               A114309
%Y A159559 Adjacent sequences: A159556 A159557 A159558 this_sequence A159560 A159561 
               A159562
%K A159559 nonn
%O A159559 2,1
%A A159559 Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 15 2009, May 04 2009
%E A159559 More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 28 2009