login
A180580
Number of occurrences of most frequent decimal digit(s) in Fibonacci(n).
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 1, 2, 2, 1, 3, 1, 2, 2, 2, 2, 3, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 4, 2, 3, 3, 2, 2, 4, 3, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 2, 3, 4, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 4, 5, 4, 3, 4, 5, 5, 4, 4, 3, 4, 5, 4, 4, 5, 5, 5, 4, 6, 5, 4, 4, 4, 3
OFFSET
1,10
COMMENTS
One or more digits can occur with the highest frequency.
LINKS
EXAMPLE
a(22) = 3 since Fib(22) = 17711 and the most frequent decimal digit (1) occurs 3 times.
MATHEMATICA
Table[Max[DigitCount[Fibonacci[n]]], {n, 100}] (* Harvey P. Dale, Jun 25 2017 *)
PROG
(Sage) def A180580(n): return max(fibonacci(n).digits().count(d) for d in [0..9])
CROSSREFS
Cf. A000045.
Sequence in context: A300953 A145740 A138516 * A026513 A349497 A106028
KEYWORD
nonn,base
AUTHOR
Carmine Suriano, Jan 21 2011
STATUS
approved