login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..27.

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: A193888 A305192 A141186 * A331205 A075174 A075176

Adjacent sequences:  A078679 A078680 A078681 * A078683 A078684 A078685

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Dec 17 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 22:46 EDT 2021. Contains 347651 sequences. (Running on oeis4.)