login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179118 Number of Collatz steps to reach 1 starting with 2^n + 1. 3
1, 7, 5, 19, 12, 26, 27, 121, 122, 35, 36, 156, 113, 52, 53, 98, 99, 100, 101, 102, 72, 166, 167, 168, 169, 170, 171, 247, 173, 187, 188, 251, 252, 178, 179, 317, 243, 195, 196, 153, 154, 155, 156, 400, 326, 495, 496, 161, 162, 331, 332, 408, 471, 410, 411, 337, 338, 339, 340, 553 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

There are many long runs of consecutive terms that increase by 1 (see second conjecture in A277109). For n < 40000, the longest run has 1030 terms starting from a(33237) = 244868 and ending with a(34266) = 245897. - Dmitry Kamenetsky, Sep 30 2016

LINKS

Dmitry Kamenetsky, Table of n, a(n) for n = 0..9999 (terms n = 1...1000 from Mitch Harris)

MathOverflow, Introduced on Mathoverflow by Henrik RĂ¼ping

FORMULA

a(n) = A006577(2^n+1) = A006577(A000051(n)).

a(n) = A075486(n) - 1. - T. D. Noe, Jan 17 2013

EXAMPLE

a(1)=7 because the trajectory of 2^1+1=3 is (3,10,5,16,8,4,2,1).

MATHEMATICA

CollatzNext[n_] := If[Mod[n, 2] == 0, n/2, 3 n + 1]; CollatzPath[n_] := CollatzPath[n] = Module[{k = n, l = {}}, While[k != 1, k = CollatzNext[k]; l = Append[l, k]]; l]; Collatz[n_] := Length[CollatzPath[n]]; Table[Collatz[2^n+1], {n, 1, 50}]

f[n_] := Length@ NestWhileList[If[OddQ@ #, 3 # + 1, #/2] &, 2^n + 1, # > 1 &] - 1; Array[f, 60] (* Robert G. Wilson v, Jan 05 2011 *)

Array[-1 + Length@ NestWhileList[If[EvenQ@ #, #/2, 3 # + 1] &, 2^# + 1, # > 1 &] &, 60, 0] (* Michael De Vlieger, Nov 25 2018 *)

PROG

(Python)

def steps(a):

  if a==1:     return 0

  elif a%2==0: return 1+steps(a/2)

  else:        return 1+steps(a*3+1)

for n in range(60):

  print n, steps((1<<n)+1)

(PARI) nbsteps(n)= s=n; c=0; while(s>1, s=if(s%2, 3*s+1, s/2); c++); c;

a(n) = nbsteps(2^n+1); \\ Michel Marcus, Oct 28 2018

CROSSREFS

Cf. A000051, A006577, A070976, A074472, A075486, A193688 (starting with 2^n-1), , A179118, A277109.

Sequence in context: A064024 A284085 A204138 * A166639 A078747 A213835

Adjacent sequences:  A179115 A179116 A179117 * A179119 A179120 A179121

KEYWORD

nonn,easy

AUTHOR

Mitch Harris, Jan 04 2011

EXTENSIONS

a(0)=1 prepended by Alois P. Heinz, Dec 12 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 09:06 EST 2019. Contains 330020 sequences. (Running on oeis4.)