Padovan n-step number sequences: Difference between revisions
Content added Content deleted
(/Realize in F#) |
|||
Line 579: | Line 579: | ||
</pre> |
</pre> |
||
=={{header|F_Sharp|F#}}== |
|||
<lang fsharp> |
|||
// Padovan n-step number sequences. Nigel Galloway: July 28th., 2021 |
|||
let rec pad=function 2->Seq.unfold(fun(n:int[])->Some(n.[0],Array.append n.[1..2] [|Array.sum n.[0..1]|]))[|1;1;1|] |
|||
|g->Seq.unfold(fun(n:int[])->Some(n.[0],Array.append n.[1..g] [|Array.sum n.[0..g-1]|]))(Array.ofSeq(pad(g-1)|>Seq.take(g+1))) |
|||
[2..8]|>List.iter(fun n->pad n|>Seq.take 15|>Seq.iter(printf "%d "); printfn "") |
|||
</lang> |
|||
{{out}} |
|||
<pre> |
|||
1 1 1 2 2 3 4 5 7 9 12 16 21 28 37 |
|||
1 1 1 2 3 4 6 9 13 19 28 41 60 88 129 |
|||
1 1 1 2 3 5 7 11 17 26 40 61 94 144 221 |
|||
1 1 1 2 3 5 8 12 19 30 47 74 116 182 286 |
|||
1 1 1 2 3 5 8 13 20 32 51 81 129 205 326 |
|||
1 1 1 2 3 5 8 13 21 33 53 85 136 218 349 |
|||
1 1 1 2 3 5 8 13 21 34 54 87 140 225 362 |
|||
</pre> |
|||
=={{header|Go}}== |
=={{header|Go}}== |
||
{{trans|Wren}} |
{{trans|Wren}} |