diff --git a/docs/conceptual/collections.seq-module-[fsharp].md b/docs/conceptual/collections.seq-module-[fsharp].md
index ef962837..8bb24da3 100644
--- a/docs/conceptual/collections.seq-module-[fsharp].md
+++ b/docs/conceptual/collections.seq-module-[fsharp].md
@@ -101,7 +101,7 @@ For an overview of sequences in F#, see [Sequences (F#)](Sequences-%
|[tryFind](https://msdn.microsoft.com/library/ac43c6f5-4dc7-4e9a-a222-00b5736aee47)
**: ('T -> bool) -> seq<'T> -> 'T option**|Returns the first element for which the given function returns **true**, or **None** if no such element exists.|
|[tryFindIndex](https://msdn.microsoft.com/library/c357b221-edf6-4f68-bf40-82a3156d945a)
**: ('T -> bool) -> seq<'T> -> int option**|Returns the index of the first element in the sequence that satisfies the given predicate, or **None** if no such element exists.|
|[tryPick](https://msdn.microsoft.com/library/4c50c77b-43e0-4f00-8bf6-9daf33ec97d5)
**: ('T -> 'U option) -> seq<'T> -> 'U option**|Applies the given function to successive elements, returning the first value where the function returns a **Some** value.|
-|[unfold](https://msdn.microsoft.com/library/7d9232fc-742e-42bc-bdf7-6f130f0eff21)
**: ('State -> 'T * 'State option) -> 'State -> seq<'T>**|Returns a sequence that contains the elements generated by the given computation.|
+|[unfold](https://msdn.microsoft.com/library/7d9232fc-742e-42bc-bdf7-6f130f0eff21)
**: ('State -> ('T * 'State) option) -> 'State -> seq<'T>**|Returns a sequence that contains the elements generated by the given computation.|
|[where](https://msdn.microsoft.com/library/e6b5bf50-4716-423c-98fe-f77d03bb6f7f)
**: ('T -> bool) -> seq<'T> -> seq<'T>**|Returns a new collection containing only the elements of the collection for which the given predicate returns **true**. A synonym for [Seq.filter](https://msdn.microsoft.com/library/7f2e9850-a660-460c-9831-3bbff5613770).|
|[windowed](https://msdn.microsoft.com/library/8b565b8f-d645-4dba-be22-099075fe4744)
**: int -> seq<'T> -> seq<'T []>**|Returns a sequence that yields sliding windows of containing elements drawn from the input sequence. Each window is returned as a fresh array.|
|[zip](https://msdn.microsoft.com/library/0a5df8bf-0d48-44ce-bff4-e8ef1df5bca4)
**: seq<'T1> -> seq<'T2> -> seq<'T1 * 'T2>**|Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: when one sequence is exhausted any remaining elements in the other sequence are ignored.|
@@ -121,4 +121,4 @@ Supported in: 2.0, 4.0, Portable
[Sequences (F#)](Sequences-%5BFSharp%5D.md)
-[Collections.seq<'T> Type Abbreviation (F#)](Collections.seq%5B%27T%5D-Type-Abbreviation-%5BFSharp%5D.md)
\ No newline at end of file
+[Collections.seq<'T> Type Abbreviation (F#)](Collections.seq%5B%27T%5D-Type-Abbreviation-%5BFSharp%5D.md)