login
A078682
Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives primes reached.
0
2, 3, 5, 9094059599, 41, 9094059599, 11, 41, 9094059599, 23, 17, 41, 99390677, 9094059599, 23, 542705556759647203359434240657, 59, 41, 29, 99390677, 9094059599, 113, 53, 542705556759647203359434240657, 16323879599, 59, 41
OFFSET
1,1
PROG
(PARI) a(n)=if(n<0, 0, s=n; c=1; while(isprime(ceil(3*s/2))==0, s=ceil(3*s/2); c++); ceil(3*s/2))
CROSSREFS
Sequence in context: A361312 A305192 A141186 * A331205 A075174 A075176
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Dec 17 2002
STATUS
approved