Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067849
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067849 a(n) = max{k: f(n),...,f^k(n) are prime}, where f(m) = 2m+1 and f^k denotes composition of f with itself k times. +0
1
2, 4, 1, 0, 3, 1, 0, 1, 1, 0, 2, 0, 0, 2, 1, 0, 0, 1, 0, 3, 1, 0, 1, 0, 0, 2, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 2, 0, 0, 6, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 2, 0, 0, 0, 0 (list; graph; listen)
OFFSET

1,1

EXAMPLE

f(2) = 5, f(f(2)) = 11, f(f(f(2))) = 23, f(f(f(f(2)))) = 47, all prime, but f^5(2) = 95 is not prime, so a(2) = 4.

MATHEMATICA

f[n_] := Module[{a = 2n + 1, i = 0}, While[PrimeQ[a], i++; a = 2a + 1]; i]; Table[f[i], {i, 1, 60}]

CROSSREFS

Sequence in context: A010586 A070678 A124091 this_sequence A164268 A152433 A094344

Adjacent sequences: A067846 A067847 A067848 this_sequence A067850 A067851 A067852

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Feb 14 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 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research