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!)
A224533 Odd numbers n for which the number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n. 3
1, 335, 1249, 2013, 6557, 6801, 6803, 7501, 7505, 10219, 22633, 25183, 27075, 31839, 36633, 36691, 40985, 45013, 45027, 45041, 59365, 61601, 64577, 64579, 75179, 75507, 77267, 86015, 88465, 88473, 97059, 97061, 97069, 97073, 97075, 97261, 107903, 108545 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n = 1..1000

MATHEMATICA

Collatz[n_] := NestWhileList[If[EvenQ[#], #/2, 3*# + 1] &, n, # > 1 &]; Select[Range[1, 100000, 2], Position[Collatz[#], Max[Collatz[#]]] == {{(Length[Collatz[#]] + 1)/2}} &]

CROSSREFS

Cf. A224303.

Sequence in context: A253227 A105099 A038648 * A253346 A253353 A204612

Adjacent sequences:  A224530 A224531 A224532 * A224534 A224535 A224536

KEYWORD

nonn

AUTHOR

T. D. Noe, Apr 14 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 September 28 05:33 EDT 2020. Contains 337392 sequences. (Running on oeis4.)