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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226110 a(1) = 0. For n > 1, a(n) = maximum distance between two consecutive elements in Collatz(3x+1) trajectory of n. 1
0, 1, 11, 2, 11, 11, 35, 4, 35, 11, 35, 11, 27, 35, 107, 8, 35, 35, 59, 11, 43, 35, 107, 12, 59, 27, 6155, 35, 59, 107, 6155, 16, 67, 35, 107, 35, 75, 59, 203, 20, 6155, 43, 131, 35, 91, 107, 6155, 24, 99, 59, 155, 27, 107, 6155, 6155, 35, 131, 59, 203, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n) = max(abs(A070165(n,k+1) - A070165(n,k)): k=1..A006577(n)-1). - Reinhard Zumkeller, May 30 2013

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

MATHEMATICA

coll[n_] := NestWhileList[If[EvenQ[#], #/2, 3#+1] &, n, #>1 &]; Join[{0}, Table[Max[Abs[Differences[coll[n]]]], {n, 2, 60}]]

PROG

(Haskell)

a226110 1 = 0

a226110 n = maximum $ map abs $ zipWith (-) (tail ts) ts

   where ts = a070165_row n

-- Reinhard Zumkeller, May 30 2013

CROSSREFS

Cf. A070165.

Sequence in context: A273877 A066795 A079366 * A323484 A330521 A318927

Adjacent sequences:  A226107 A226108 A226109 * A226111 A226112 A226113

KEYWORD

nonn

AUTHOR

Jayanta Basu, May 27 2013

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 July 4 13:35 EDT 2020. Contains 335448 sequences. (Running on oeis4.)