|
%I #7 Dec 21 2017 04:37:32
%S 0,0,0,0,0,0,0,1,1,1,2,2,1,1,2,1,2,2,3,2,2,2,2,3,2,3,3,3,2,2,2,2,2,2,
%T 3,2,2,2,2,2,2,2,3,2,2,3,2,3,2,3,3,3,3,2,2,3,3,2,3,2,2,2,2,2,2,3,3,3,
%U 2,3,2,3,2,3,3,3,3,3,2,3,3,3,3,3,2,3,2
%N Additive persistence of Fibonacci numbers.
%C Up to 10000 the maximum value is 4.
%e 3524578 -> 3+5+2+4+5+7+8 = 34 -> 3+4 = 7 -> persistence = 2
%p with(numtheory): with(combinat): P:=proc(n) local a,t; t:=0; a:=fibonacci(n); while a>9 do t:=t+1; a:=convert(convert(a,base,10),`+`); od; t;
%p end: seq(P(i),i=0..10^2);
%Y Cf. A000045.
%K easy,nonn,base
%O 0,11
%A _Paolo P. Lava_ and _Giorgio Balzarotti_, Jun 19 2007, corrected Jun 22 2007
%E Corrected entries and changed Maple code by _Paolo P. Lava_, Dec 19 2017
|
