Fibonacci Quarterly 49(2), pp. 134–138.

**ISSN/ISBN:** Not available at this time.
**DOI:** Not available at this time.

- For online information, click here.

**Abstract:** A large class of deterministic sequences are known to obey Benford’s law. Recall that a sequence {xn} obeys Benford’s law if and only if log10 |xn| (mod 1) is uniformly distributed. It is proved herein that a particular class of sequences defined by multiplicative recursions obey Benford’s law. This includes the three-term multiplicative Fibonacci sequence defined by xn = xn−1 · xn−2.

**Bibtex:**

```
@article {,
AUTHOR = {Romano, Paul K. and {McLaughlin}, Harry},
TITLE = {On non-linear recursive sequences and Benford’s Law},
JOURNAL = {Fibonacci Quarterly},
YEAR = {2011},
VOLUME = {49},
NUMBER = {2},
PAGES = {134–-138},
URL = {https://www.fq.math.ca/Papers1/49-2/RomanoMcLaughlin.pdf},
}
```

**Reference Type:** Journal Article

**Subject Area(s):** Number Theory