Hailstone sequence: Difference between revisions

m
no edit summary
(Added hailstone (Collatz) sequence for EDSAC)
mNo edit summary
Line 5,673:
Set x=$$hailstone(27) Write !,$Length(x," ")," terms in ",x,!
112 terms in 27 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1186 593 1780 890 445 1336 668 334 167 502 251 754 377 1132 566 283 850 425 1276 638 319 958 479 1438 719 2158 1079 3238 1619 4858 2429 7288 3644 1822 911 2734 1367 4102 2051 6154 3077 9232 4616 2308 1154 577 1732 866 433 1300 650 325 976 488 244 122 61 184 92 46 23 70 35 106 53 160 80 40 20 10 5 16 8 4 2 1</lang>
 
=={{header|Nanoquery}}==
<lang Nanoquery>def hailstone($n)
$seq = list()
 
while ($n > 1)
append $seq $n
if ($n % 2)=0
$n = int($n / 2)
else
$n = int((3 * $n) + 1)
end
end
append $seq $n
return $seq
end
 
$h = hailstone(27)
println "hailstone(27)"
println "total elements: " + len(hailstone(27))
print $h[0] + ", " + $h[1] + ", " + $h[2] + ", " + $h[3] + ", ..., "
println $h[-4] + ", " + $h[-3] + ", " + $h[-2] + ", " + $h[-1]
 
$max = 0
$maxLoc = 0
for $i in range(1,99999)
$result = len(hailstone($i))
if ($result > $max)
$max = $result
$maxLoc = $i
end
end
print "\nThe number less than 100,000 with the longest sequence is "
println $maxLoc + " with a length of " + $max</lang>
{{out}}
<pre>hailstone(27)
total elements: 112
27, 82, 41, 124, ..., 8, 4, 2, 1
 
The number less than 100,000 with the longest sequence is 77031 with a length of 351</pre>
 
=={{header|NetRexx}}==
Anonymous user