|
Search: id:A051918
|
|
|
| A051918 |
|
Start with n, apply k->2k+1 until reach new record prime; sequence gives number of steps needed. |
|
+0
2
|
|
| 2, 2, 2, 3, 4, 5, 5, 10, 13, 13, 26, 32, 287
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
EXAMPLE
|
0->1->3, new record prime 3 in 2 steps; 1->3->7, new record prime 7 in 2 steps; 2->5->11, new record prime 11 in 2 steps; 3->7->15->31, new record prime 31 in 3 steps.
For the next few terms we have: 4->9->19->39->79; 5->11->23->47->95->191; 6->13->27->55->111->223; 7->15->31->63->127->255->511->1023->2047->4095->8191; etc.
|
|
CROSSREFS
|
Cf. A051919, A052333.
Sequence in context: A008906 A029074 A036016 this_sequence A163801 A104661 A029049
Adjacent sequences: A051915 A051916 A051917 this_sequence A051919 A051920 A051921
|
|
KEYWORD
|
nice,nonn,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 18 1999
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), May 21 2001
|
|
|
Search completed in 0.002 seconds
|
