A180580 - OEIS

%I #14 Jun 25 2017 13:51:54

%S 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,

%T 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,

%U 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

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

%C One or more digits can occur with the highest frequency.

%H Carmine Suriano, <a href="/A180580/b180580.txt">Table of n, a(n) for n = 1..1150</a>

%e a(22) = 3 since Fib(22) = 17711 and the most frequent decimal digit (1) occurs 3 times.

%t Table[Max[DigitCount[Fibonacci[n]]],{n,100}] (* _Harvey P. Dale_, Jun 25 2017 *)

%o (Sage) def A180580(n): return max(fibonacci(n).digits().count(d) for d in [0..9])

%Y Cf. A000045.

%K nonn,base

%O 1,10

%A _Carmine Suriano_, Jan 21 2011