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.

A001179 Leonardo logarithm of n.

Original entry on oeis.org

0, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 3, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1
Offset: 1

Views

Author

Keywords

Comments

Are the powers of 5 (together with 2) the indices of records in this sequence? - Charles R Greathouse IV, Aug 11 2022

References

  • B. H. Hannon and W. L. Morris, Tables of Arithmetical Functions Related to the Fibonacci Numbers. Report ORNL-4261, Oak Ridge National Laboratory, Oak Ridge, Tennessee, Jun 1968.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Haskell
    a001179 1 = 0
    a001179 n = if p == n then ll (p `div` 24) 1 else a001179 p
                where p = a001175 n
                      ll x k = if x == 1 then k else ll (x `div` 5) (k + 1)
    -- Reinhard Zumkeller, Jan 15 2014

Formula

A235249(n) = 24*5^(a(n)-1) for n > 1. - Reinhard Zumkeller, Jan 15 2014