{"provider_name":"Hatena Blog","width":"100%","title":"\u5bfe\u8a71\u306b\u3088\u308bCommon Lisp\u5165\u9580 28 \u518d\u5e30","provider_url":"https://hatena.blog","height":"190","author_name":"shigemk2","image_url":null,"blog_url":"https://www.shigemk2.com/","version":"1.0","blog_title":"by shigemk2","author_url":"https://blog.hatena.ne.jp/shigemk2/","type":"rich","categories":["\u8aad\u66f8\u30ce\u30fc\u30c8"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fwww.shigemk2.com%2Fentry%2F20130408%2F1365351242\" title=\"\u5bfe\u8a71\u306b\u3088\u308bCommon Lisp\u5165\u9580 28 \u518d\u5e30 - by shigemk2\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://www.shigemk2.com/entry/20130408/1365351242","published":"2013-04-08 01:14:02","description":";; m to the Nth power (defun expt$ (m n) (if (= n 0) 1 (* (expt$ m (- n 1)) m))) ;; number of k-combinations (defun C (n k) (if (= k 0) 1 (* (/ n k) (C (- n 1) (- k 1))))) ;; number of k-combinations 2 (defun C2 (n k) (if (= k 0) 1 (if (= n k) 1 (+ (C (- n 1) (- k 1)) (C (- n 1) k))))) \u7d50\u679c [28]> (exp\u2026"}