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.

A246701 First differences of A246520.

Original entry on oeis.org

3, 7, 10, 16, 9, 27, 32, 32, 17, 17, 38, 64, 64, 64, 64, 64, 33, 33, 33, 33, 33, 107, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 150, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 129, 129
Offset: 0

Views

Author

Reinhard Zumkeller, Sep 04 2014

Keywords

Comments

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

Programs

  • Haskell
    a246701 n = a246701_list !! n
    a246701_list = zipWith (-) (tail a246520_list) a246520_list
    
  • Python
    def A246701(n):
        return(max(int(bin(n+1-k)[2:]+bin(n+1+k)[2:],2) for k in range(n+2)) -max(int(bin(n-k)[2:]+bin(n+k)[2:],2) for k in range(n+1)))
    # Chai Wah Wu, Sep 07 2014