Sequence: smallest number with exactly n divisors: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,379: / Line 1,379: @@
 [1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144]
 </pre>
+=={{header|Tcl}}==
+<lang Tcl>proc divCount {n} {
+    set cnt 0
+    for {set d 1} {($d * $d) <= $n} {incr d} {
+        if {0 == ($n % $d)} {
+            incr cnt
+            if {$d < ($n / $d)} {
+                incr cnt
+            }
+        }
+    }
+    return $cnt
+}
+proc A005179 {n} {
+    if {$n >= 1} {
+        for {set k 1} {1} {incr k} {
+            if {$n == [divCount $k]} {
+                return $k
+            }
+        }
+    }
+    return 0
+}
+proc show {func lo hi} {
+    puts "${func}($lo..$hi) ="
+    for {set n $lo} {$n <= $hi} {incr n} {
+        puts -nonewline " [$func $n]"
+    }
+    puts ""
+}
+show A005179 1 15
+</lang>
+{{out}}
+<pre>A005179(1..15) =
+2 4 6 16 12 64 24 36 48 1024 60 4096 192 144</pre>
 =={{header|zkl}}==