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.

A171868 First differences of A171865.

Original entry on oeis.org

1, 2, 2, 5, 2, 5, 3, 4, 6, 5, 6, 3, 3, 5, 4, 3, 4, 3, 6, 9, 3, 5, 3, 6, 3, 4, 5, 6, 5, 4, 4, 5, 4, 4, 6, 4, 4, 6, 6, 5, 6, 4, 4, 9, 3, 3, 6, 4, 3, 10, 3, 4, 4, 6, 4, 5, 3, 3, 6, 6, 7, 3, 5, 4, 5, 4, 6, 6, 6, 5, 4, 6, 4, 4, 6, 4, 5, 4, 7, 3, 4, 5, 4, 8, 10, 3, 5, 5, 6, 3, 8, 4, 4, 6, 7, 6, 6, 10, 4, 4, 8, 3, 4, 4
Offset: 1

Views

Author

N. J. A. Sloane, Oct 18 2010

Keywords

Crossrefs

Identical to A171889 except for the leading 0. - Jan Ritsema van Eck (j.ritsemavaneck(AT)planet.nl), Oct 19 2010

Programs

  • Haskell
    a171868 n = a171868_list !! (n-1)
    a171868_list = zipWith (-) (tail a171865_list) a171865_list
    -- Reinhard Zumkeller, Oct 31 2011
    
  • Python
    A181391_list, A171868_list, l = [0, 0], [1], 0
    for n in range(1, 10**4):
        for m in range(n-1, -1, -1):
            if A181391_list[m] == A181391_list[n]:
                A181391_list.append(n-m)
                break
        else:
            A181391_list.append(0)
            A171868_list.append(n-l)
            l = n # Chai Wah Wu, Jan 02 2015