The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 27 18:55 EDT 2023. Contains 361575 sequences. (Running on oeis4.)