|
| |
|
|
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
|
|
13
| |
|
|
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, 42, 44, 47, 48, 53, 54, 55, 56, 57, 58, 59, 60, 62, 63, 67, 68, 71, 72, 74, 75, 79, 80, 81, 82, 84, 85, 89, 90, 91, 92, 93, 94, 97, 98, 101, 102, 104, 105, 106, 108, 109, 110, 111
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
COMMENTS
| a(n) is prime iff n is prime.
|
|
|
LINKS
| Charles R Greathouse IV, Table of n, a(n) for n = 2..10000
V. Shevelev, Several results on sequences which are similar to the positive integers
|
|
|
FORMULA
| 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}.
|
|
|
MAPLE
| 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]
|
|
|
CROSSREFS
| Sequence in context: A079253 A076054 A139636 * A047583 A010906 A114309
Adjacent sequences: A159556 A159557 A159558 * A159560 A159561 A159562
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 15 2009, May 04 2009
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 28 2009
|
| |
|
|
