|
|
A130633
|
|
Additive persistence of Fibonacci numbers.
|
|
0
|
|
|
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, 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, 2, 3, 2, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,11
|
|
COMMENTS
|
Up to 10000 the maximum value is 4.
|
|
LINKS
|
|
|
EXAMPLE
|
3524578 -> 3+5+2+4+5+7+8 = 34 -> 3+4 = 7 -> persistence = 2
|
|
MAPLE
|
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;
end: seq(P(i), i=0..10^2);
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Corrected entries and changed Maple code by Paolo P. Lava, Dec 19 2017
|
|
STATUS
|
approved
|
|
|
|