A216186 Decimal expansion of the topological entropy of a two step random Fibonacci substitution.

0, 7, 2, 9, 5, 0, 2, 3, 3, 4, 0, 9, 3, 7, 5, 7, 0, 8, 1, 1, 1, 0, 6, 3, 0, 9, 9, 4, 7, 4, 7, 4, 1, 8, 7, 3, 7, 9, 5, 5, 2, 5, 4, 3, 8, 3, 3, 5, 5, 3, 4, 9, 8, 2, 9, 2, 0, 6, 1, 0, 6, 7, 1, 1, 3, 5, 4, 7, 8, 5, 9, 0, 9, 4, 4, 1, 2, 4, 8, 5, 3, 4, 2, 0, 7, 6, 6, 0, 4, 8, 7, 1, 6, 7, 3, 2, 4, 8, 0, 6, 9, 3, 4, 6, 6

Offset

0,2

Comments

See Theorem 2 of the Nilsson reference.

Links

Table of n, a(n) for n=0..104.

Johan Nilsson, On the Entropy of a Two Step Random Fibonacci Substitution, arXiv:1303.2526 [math.CO], 2013.

Formula

Equals log(2)/(1+sqrt(5)/2)^3.

Example

0.0729502334093757...

Mathematica

First[RealDigits[Log[2]/(1 + Sqrt[5]/2)^3, 10, 100, -1]] (* Paolo Xausa, Jun 18 2024 *)

Crossrefs

Cf. A002162 (log(2)).

Sequence in context: A021987 A031026 A366019 * A333360 A021936 A277525

Adjacent sequences: A216183 A216184 A216185 * A216187 A216188 A216189

Keyword

nonn,easy,cons

Author

Jonathan Vos Post, Mar 11 2013

Status

approved