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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A081246 Triangle in which (2^n+1)st row gives trajectory of x=2^n+1 under the map x -> x/2 if x is even, x -> x+1 if x is odd, stopping when reaching 1. 0
 3, 4, 2, 1, 5, 6, 3, 4, 2, 1, 9, 10, 5, 6, 3, 4, 2, 1, 17, 18, 9, 10, 5, 6, 3, 4, 2, 1, 33, 34, 17, 18, 9, 10, 5, 6, 3, 4, 2, 1, 65, 66, 33, 34, 17, 18, 9, 10, 5, 6, 3, 4, 2, 1, 129, 130, 65, 66, 33, 34, 17, 18, 9, 10, 5, 6, 3, 4, 2, 1, 257, 258, 129, 130, 65, 66, 33, 34, 17, 18, 9, 10, 5, 6, 3, 4, 2, 1, 513, 514, 257, 258, 129, 130, 65, 66, 33, 34, 17, 18, 9, 10, 5, 6, 3, 4, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is the 2^n+1 conjecture and is easily proved to converge to 1. The number of steps required to reach 1 is always 2n+2. Since (2^(n)+1+1)/2 = 2^(n-1)+1 (2^(n-1)+1+1)/2 = 2^(n-2)+1 .... (2^(n-n+1)+1+1)/2 = 2^(n-n)+1 = 2 2/2 = 1 thus 1 is guaranteed. LINKS Table of n, a(n) for n=1..108. EXAMPLE n = 5 -> 33,34,17,18,9,10,5,6,3,4,2,1 MAPLE pxpr(n) = { for(x=1, n, x1=2^x+1; print1(x1" "); while(x1>1, if(x1%2==0, x1/=2, x1 = x1+1); print1(x1" "); ) ) } MATHEMATICA Table[NestWhileList[If[EvenQ[#], #/2, #+1]&, 2^n+1, #!=1&], {n, 10}]//Flatten (* Harvey P. Dale, Jan 05 2019 *) CROSSREFS Sequence in context: A239678 A136374 A303869 * A264928 A323874 A326765 Adjacent sequences: A081243 A081244 A081245 * A081247 A081248 A081249 KEYWORD easy,nonn,tabf AUTHOR Cino Hilliard, Apr 19 2003 EXTENSIONS Corrected and extended by Harvey P. Dale, Jan 05 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 July 24 15:18 EDT 2024. Contains 374584 sequences. (Running on oeis4.)