|
%I #8 May 30 2013 11:03:00
%S 0,1,11,2,11,11,35,4,35,11,35,11,27,35,107,8,35,35,59,11,43,35,107,12,
%T 59,27,6155,35,59,107,6155,16,67,35,107,35,75,59,203,20,6155,43,131,
%U 35,91,107,6155,24,99,59,155,27,107,6155,6155,35,131,59,203,107
%N a(1) = 0. For n > 1, a(n) = maximum distance between two consecutive elements in Collatz(3x+1) trajectory of n.
%C a(n) = max(abs(A070165(n,k+1) - A070165(n,k)): k=1..A006577(n)-1). - _Reinhard Zumkeller_, May 30 2013
%H Reinhard Zumkeller, <a href="/A226110/b226110.txt">Table of n, a(n) for n = 1..10000</a>
%t coll[n_] := NestWhileList[If[EvenQ[#],#/2,3#+1] &,n,#>1 &]; Join[{0}, Table[Max[Abs[Differences[coll[n]]]], {n,2,60}]]
%o (Haskell)
%o a226110 1 = 0
%o a226110 n = maximum $ map abs $ zipWith (-) (tail ts) ts
%o where ts = a070165_row n
%o -- _Reinhard Zumkeller_, May 30 2013
%Y Cf. A070165.
%K nonn
%O 1,3
%A _Jayanta Basu_, May 27 2013
|
