A180580 Number of occurrences of most frequent decimal digit(s) in Fibonacci(n).

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

Carmine Suriano, Table of n, a(n) for n = 1..1150

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

Adjacent sequences: A180577 A180578 A180579 * A180581 A180582 A180583

Keyword

nonn,base

Author

Carmine Suriano, Jan 21 2011

Status

approved