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.

A261812 First differences of A098842.

Original entry on oeis.org

-2, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0
Offset: 1

Views

Author

Andrew R. Reiter, Sep 01 2015

Keywords

Programs

  • Mathematica
    Most@ Differences[ Last /@ Tally[ Max[ IntegerLength@#, 1] & /@ Fibonacci[ Range[0, 900]]]] (* Giovanni Resta, Sep 02 2015 *)
  • Python
    import sys
    import math
    F = [F0,F1] = [0,1]
    c = 2
    c0 = 0
    ll0 = 1
    while True:
            T = F[0] + F[1]
            F[0] = F[1]
            F[1] = T
            dfn = 1 + math.log10(T)
            ll = math.floor(dfn)
            if ll0 != ll:
                    if c0 != 0:
                            sys.stdout.write("%d," % (c-c0))
                    ll0 = ll
                    c0 = c
                    c = 1
                    continue
            c += 1

Formula

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