login
This site is supported by donations to The OEIS 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; internal format)
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: A175309 A193888 A141186 * A075174 A075176 A134972

Adjacent sequences:  A078679 A078680 A078681 * A078683 A078684 A078685

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 17 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 15:55 EST 2012. Contains 205933 sequences.