|
%I #17 Sep 24 2015 01:36:33
%S -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,
%T -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,
%U 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
%N First differences of A098842.
%F a(n) = A098842(n+1) - A098842(n).
%t Most@ Differences[ Last /@ Tally[ Max[ IntegerLength@#, 1] & /@ Fibonacci[ Range[0, 900]]]] (* _Giovanni Resta_, Sep 02 2015 *)
%o (Python)
%o import sys
%o import math
%o F = [F0,F1] = [0,1]
%o c = 2
%o c0 = 0
%o ll0 = 1
%o while True:
%o T = F[0] + F[1]
%o F[0] = F[1]
%o F[1] = T
%o dfn = 1 + math.log10(T)
%o ll = math.floor(dfn)
%o if ll0 != ll:
%o if c0 != 0:
%o sys.stdout.write("%d," % (c-c0))
%o ll0 = ll
%o c0 = c
%o c = 1
%o continue
%o c += 1
%K sign,base
%O 1,1
%A _Andrew R. Reiter_, Sep 01 2015
|
