Merge pull request #6 from OpenLibMathSeq/dev

Dev

Author: OpenLibMathSeq

README.md

@@ -5,7 +5,7 @@
 [![Docs dev](https://img.shields.io/badge/docs-dev-blue.svg)](https://openlibmathseq.github.io/IntegerSequences.jl/dev)
 --
 
-Requires Julia version ≥ 1.1 .
+The package is tested against, and being developed for, Julia 1.1 and above on Linux, macOS, and Windows64.
 
 ## Naming conventions
 
@@ -222,7 +222,7 @@ Sequences are fun!
 * Start with cloning the module [NarayanaCows](https://github.com/OpenLibMathSeq/IntegerSequences.jl/blob/master/src/NarayanaCows.jl)
 as a blueprint. Replace what is to be replaced.
 
-* Execute the module 'BuildSequences' which will integrate your module into 'Sequences'.
+* Execute the module 'BuildSequences' which will integrate your module into 'IntegerSequences'.
 
 * Send us a pull request.
 

docs/Project.toml

@@ -1,4 +1,4 @@
-name = "Sequences-docs"
+name = "IntegerSequences-docs"
 
 [deps]
 Documenter = "e30172f5-a6a5-5a46-863b-614d45cd2de4"

docs/make.jl

@@ -1,4 +1,6 @@
-push!(LOAD_PATH, "../src/")
+prodir = realpath(joinpath(dirname(dirname(@__FILE__))))
+srcdir = joinpath(prodir, "src")
+srcdir ∉ LOAD_PATH && push!(LOAD_PATH, srcdir)
 
 using Documenter, IntegerSequences
 

docs/src/developerguide.md

@@ -77,11 +77,11 @@ in a final step.
 All terms of all sequences have the same type. Currently this is the
 type fmpz as provided by the Nemo library.
 
-Sequences supports the use of notation using unicode characters, especially the
-traditional notation used in number theory. For example we define
+IntegerSequences supports the use of notation using unicode characters, especially the traditional notation used in number theory. For example we define
 ```
     τ(n) = Nemo.sigma(n, 0)
     μ(n) = Nemo.moebiusmu(n)
+    V006171(n) = EulerTransform(τ)(n)
 ```
 We also support new notations like the proposal from Knuth, Graham and
 Patashnik in Concrete Mathematics:
@@ -96,8 +96,7 @@ where `isPrimeTo` is defined as:
 
 For example ``⊥(n, ϕ(n))`` indicates if there is just one group of order ``n``.
 But this is not only a concise mathematical formula, this is also valid Julia
-code (defined in Sequences). The predicate gives rise to the sequence of cyclic
-numbers, A003277 in the OEIS.
+code (defined in IntegerSequences). The predicate gives rise to the sequence of cyclic numbers, A003277 in the OEIS.
 
 Similarly possible definitions of some sequences (not necessarily efficient ones
 in the computational sense) are
@@ -136,12 +135,12 @@ returned in the given order by a generating function.
 
 In the OEIS, on the other hand, a sequence is an enumeration, a set with an index function where the first index (called offset o) is specified. With this we arrive at this picture:
 
-    ``a_o, b_{o+1}, c_{o+2}, d_{o+3}, ...``
+    ``a_o, a_{o+1}, a_{o+2}, a_{o+3}, ...``
 
 In this view a list (representing the initial segment of the sequence)
 takes the place of the iteration.
 
-    ``[ a_{o}, b_{o+1}, c_{o+2}, ..., z_{o+n-1} ]``
+    ``[ a_{o}, a_{o+1}, a_{o+2}, ..., a_{o+n-1} ]``
 
 In contrast in our setup the concept of offset and indexing does not occur at all but is transferred to the interpretation: only the application decides about indexing and offset. In practice our setup avoiding the use of an offset turns out
 to be more flexible.