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.

Showing 1-1 of 1 results.

A167383 Entropy like stair step sequence based on A008185: a(n)=a(n-1)+Ceiling[ -(A008185[n + 2]/A008185[n + 1])*Log[(A008185[n + 2]/A008185[n + 1])]/Log[2]].

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 8, 9, 9, 9, 10, 10, 11, 11, 11, 11, 11, 11, 12, 13, 13, 14, 15, 15, 15, 16, 16, 16, 17, 17, 18, 18, 19, 19, 19, 19, 20, 20, 20, 21, 21, 21, 21, 22
Offset: 0

Views

Author

Roger L. Bagula, Nov 02 2009

Keywords

Comments

By using the ratio:
A008185[n + 2]/A008185[n + 1]
the sequence gets a probability effect that gives
a devil's staircase like result.

Crossrefs

Programs

  • Mathematica
    Clear[f, g, n]; f[0] = 1; f[1] = 1; f[2] = 1;
    f[n_] := f[n] = f[n - f[n - 1]] + f[n - f[n - 2]];
    g[0] = 0; g[1] = 1;
    g[n_] := g[n] = g[n - 1] + Ceiling[ -(f[n + 2]/f[n + 1])*Log[(f[n + 2]/f[n + 1])]/Log[2]]
    a = Table[g[n], {n, 0, 200}]

Formula

a(n)=a(n-1)+Ceiling[ -(A008185[n + 2]/A008185[n + 1])*Log[(A008185[n + 2]/A008185[n + 1])]/Log[2]]
Showing 1-1 of 1 results.