|
|
A110359
|
|
a(n) = n+1 if n+1 is a prime else a(n) = 2n+1 if 2n+1 is a prime else a(n) = 2*(2n+1) +1 =g(n) if this number is prime else the next candidate is 2*g(n) + 1 etc.
|
|
0
|
|
|
2, 3, 7, 5, 11, 7, 31, 17, 19, 11, 23, 13, 223, 29, 31, 17, 71, 19, 79, 41, 43, 23, 47, 199, 103, 53, 223, 29, 59, 31, 127, 131, 67, 139, 71, 37, 151, 311, 79, 41, 83, 43, 738197503, 89, 367, 47, 191, 97, 199, 101, 103, 53, 107, 109, 223, 113, 463, 59, 239, 61, 991, 251
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Subsidiary sequence: number of steps to reach a prime.
a(73) takes more than 2000 iterations, if it exists. - Joshua Zucker, May 08 2006
|
|
LINKS
|
|
|
EXAMPLE
|
a(13) = 223, 13+1 = 14 is composite, 13*2 +1 = 27 is composite, 27*2 +1 = 55, 55*2 +1 =111 and finally 111*2 +1 = 223 is a prime.
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|