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.
Union@ FoldList[Max, Nest[Append[#1, If[OddQ[#2], #1[[(#2 + 1)/2]], #1[[#2/2]] + #1[[(#2 + 2)/2]] ]] & @@ {#, Length@ # + 1} &, {0, 1}, 10^4]] (* Michael De Vlieger, Jul 10 2019 *)
fusc(n)=my(a=1, b=0); while(n, if(n%2, b+=a, a+=b); n>>=1); b r=-1;for(n=0,1e5,t=fusc(n); if(t>r,r=t;print1(t", ")))
from itertools import count, islice from functools import reduce def A212289_gen(): # generator of terms yield (c:= 0) for n in count(1): m = sum(reduce(lambda x,y:(x[0],x[0]+x[1]) if int(y) else (x[0]+x[1],x[1]),bin(n)[-1:2:-1],(1,0))) if m>c: yield (c:=m) A212289_list = list(islice(A212289_gen(),30)) # Chai Wah Wu, Sep 23 2024
fusc(n)=my(a=1, b=0); while(n, if(n%2, b+=a, a+=b); n>>=1); b r=0;for(n=1,1e5,t=fusc(n); if(t>r,r=t;print1(n", ")))
Comments