diff --git a/README.md b/README.md
index 3599bd2..a45da89 100644
--- a/README.md
+++ b/README.md
@@ -11,7 +11,7 @@ way of iterating on a finite number of values, only allocating (most of the time
 one intermediate closure to do so. For instance, iterating on keys, or values,
 of a `Hashtbl.t`, without creating a list.
 
-[![build status](https://travis-ci.org/c-cube/iter.svg?branch=master)](https://travis-ci.org/c-cube/iter)
+[![build status](https://travis-ci.org/c-cube/sequence.svg?branch=master)](https://travis-ci.org/c-cube/sequence)
 
 ## Documentation
 
@@ -21,7 +21,7 @@ To get an overview of iter (originally "sequence"), its origins and why it was c
 you can start with [the slides of a talk](http://simon.cedeela.fr/assets/talks/sequence.pdf)
 I (@c-cube) made at some OCaml meeting.
 
-See [the online API](https://c-cube.github.io/iter/)
+See [the online API](https://c-cube.github.io/sequence/)
 for more details on the set of available functions.
 
 ## Build
diff --git a/iter.opam b/iter.opam
index 8077d2a..2dd1912 100644
--- a/iter.opam
+++ b/iter.opam
@@ -23,6 +23,6 @@ homepage: "https://github.com/c-cube/iter/"
 depopts: [
   "base-bigarray"
 ]
-doc: "https://c-cube.github.io/iter/"
-bug-reports: "https://github.com/c-cube/iter/issues"
-dev-repo: "git+https://github.com/c-cube/iter.git"
+doc: "https://c-cube.github.io/sequence/"
+bug-reports: "https://github.com/c-cube/sequence/issues"
+dev-repo: "git+https://github.com/c-cube/sequence.git"