Editing Sequence (section)

===Other types of sequences===
Some other types of sequences that are easy to define include:
* An '''[[integer sequence]]''' is a sequence whose terms are integers.
* A '''[[polynomial sequence]]''' is a sequence whose terms are polynomials.
* A positive integer sequence is sometimes called '''multiplicative''', if ''a''<sub>''nm''</sub> = ''a''<sub>''n''</sub> ''a''<sub>''m''</sub> for all pairs ''n'', ''m'' such that ''n'' and ''m'' are [[coprime]].<ref>{{cite book|title=Lectures on generating functions|last=Lando|first=Sergei K.|publisher=AMS|isbn=978-0-8218-3481-7|chapter=7.4 Multiplicative sequences|date=2003-10-21}}</ref> In other instances, sequences are often called ''multiplicative'', if ''a''<sub>''n''</sub> = ''na''<sub>1</sub> for all ''n''. Moreover, a ''multiplicative'' Fibonacci sequence<ref>{{cite journal|title=Fibonacci's multiplicative sequence|first=Sergio|last=Falcon|journal=International Journal of Mathematical Education in Science and Technology|volume=34|issue=2|pages=310–315|doi=10.1080/0020739031000158362|year = 2003|s2cid=121280842}}</ref> satisfies the recursion relation ''a''<sub>''n''</sub> = ''a''<sub>''n''−1</sub> ''a''<sub>''n''−2</sub>.
* A [[binary sequence]] is a sequence whose terms have one of two discrete values, e.g. [[base 2]] values (0,1,1,0, ...), a series of coin tosses (Heads/Tails) H,T,H,H,T, ..., the answers to a set of True or False questions (T, F, T, T, ...), and so on.