The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323417 When a prime-based mapping reaches 0. 1
 3, 2, 1, 6, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Writing p_i for the i-th prime, A000040(i); let n_0 = n, and apply the mapping n_i = n_{i-1} + p_i (if p_i > n_{i-1}) else n_{i-1} - p_i. Then a(n) is the least k > 0 for which n_k = 0, or -1 if no such k exists. In the traversal of n_i for a given n, if it reaches a local minimum after subtracting p_i, it will next reach a local minimum at p_j which will be close to 3p_i. Conjecture: a(n) > 0 for all n. For n in { 6 16 20 30 42 50 51 56 70 76 84 85 90 92 }, a(n) is unknown; in each case either a(n) = -1 or a(n) > 2 * 10^12. a(n) is known for all other n <= 100: see the A-file for details. LINKS Nicholas Matteo, Known values for n in 0 .. 1000 CROSSREFS A309222 is the trajectory of this mapping with n_0 = 6. Sequence in context: A089145 A324644 A134199 * A102189 A031252 A208152 Adjacent sequences:  A323414 A323415 A323416 * A323418 A323419 A323420 KEYWORD nonn,more AUTHOR Hugo van der Sanden, Aug 30 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 16:17 EST 2021. Contains 349445 sequences. (Running on oeis4.)