Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078682
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078682 Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives primes reached. +0
1
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; listen)
OFFSET

1,1

PROGRAM

(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: A046476 A141186 A143712 this_sequence A075174 A075176 A134972

Adjacent sequences: A078679 A078680 A078681 this_sequence A078683 A078684 A078685

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research