Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165801
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165801 f(n), f(f(n)), ... are all prime, where f(n) = (n-1)/2. Stop when f(...f(n)...) is less than 4. +0
5
1, 2, 3, 5, 7, 11, 15, 23, 47, 95 (list; graph; listen)
OFFSET

1,2

COMMENT

There are no more terms since 95 is composite.

EXAMPLE

(95-1)/2=47(prime); (47-1)/2=23(prime); (23-1)/2=11(prime); (11-1)/2=5(prime); (5-1)/2=2(prime); no composite numbers smaller then 2 exists,end. (47-1)/2=23(prime);(23-1)/2=11(prime); (11-1)/2=5(prime); (5-1)/2=2;no composite numbers smaller then 2 exists,end.

MATHEMATICA

f[n_]:=Module[{k=n}, While[k>3, k=(k-1)/2; If[ !PrimeQ[k], Break[]]]; PrimeQ[k]]; lst={}; Do[If[f[n], AppendTo[lst, n]], {n, 5!}]; lst

CROSSREFS

Sequence in context: A024792 A055771 A052955 this_sequence A022480 A024791 A118084

Adjacent sequences: A165798 A165799 A165800 this_sequence A165802 A165803 A165804

KEYWORD

nonn,easy,fini,full

AUTHOR

Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 28 2009

EXTENSIONS

Corrected and edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 05 2009

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research