Padovan n-step number sequences: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,088: / Line 1,088: @@
     '''
     def go(xs):
-        return xs[0], xs[1:] + [sum(take(n)(xs))]
+        h, *t = xs
+        return h, t + [sum(take(n)(xs))]
     return go