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.
%I A246701 #12 May 22 2025 10:21:40 %S A246701 3,7,10,16,9,27,32,32,17,17,38,64,64,64,64,64,33,33,33,33,33,107,128, %T A246701 128,128,128,128,128,128,128,128,128,65,65,65,65,65,65,65,65,65,65, %U A246701 150,256,256,256,256,256,256,256,256,256,256,256,256,256,256,256,256,256,256,256,256,256,129,129 %N A246701 First differences of A246520. %C A246701 a(n) = A246520(n+1) - A246520(n). %H A246701 Reinhard Zumkeller, <a href="/A246701/b246701.txt">Table of n, a(n) for n = 0..1000</a> %o A246701 (Haskell) %o A246701 a246701 n = a246701_list !! n %o A246701 a246701_list = zipWith (-) (tail a246520_list) a246520_list %o A246701 (Python) %o A246701 def A246701(n): %o A246701 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))) %o A246701 # _Chai Wah Wu_, Sep 07 2014 %K A246701 nonn %O A246701 0,1 %A A246701 _Reinhard Zumkeller_, Sep 04 2014