cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A305394 First differences of A140103.

Original entry on oeis.org

5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 4, 5, 3, 5, 4, 5, 5, 4, 5, 3, 5, 4, 5, 4
Offset: 1

Views

Author

N. J. A. Sloane, Jun 23 2018

Keywords

Comments

Conjecture: this sequence is the ternary tribonacci word on the alphabet {5,4,3}, i.e., (a(n)) is the unique fixed point of the morphism 5 -> 54, 4 -> 53, 3 -> 5; see A092782. - Michel Dekking, Mar 13 2019
An equivalent conjecture: This sequence (prefixed by 3 since A140103 should really begin with 0) is 3.TTW(5,4,3) where TTW is the ternary tribonacci word defined in A080843, or equally it is THETA(5,4,3), where THETA is defined in A275925. There are similar conjectures for the first differences of A140100, A140101, A140102. - N. J. A. Sloane, Mar 14 2019 and Mar 19 2019
All these conjectures are now theorems - see the Dekking et al. paper. - N. J. A. Sloane, Jul 22 2019

Crossrefs

For first differences of A140100, A140101, A140102, A140103 see A305392, A305374, A305393, A305394.

Formula

a(n) = A140103(n+1) - A140103(n).