A180601 - OEIS

%I #13 Mar 01 2022 12:13:43

%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,

%U 0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,1,1,1,1,1,0,0,0,1,1,1,0,1,1,1,0,1,0,1,0,1,1,1,0,0,0,0,0,1,1,1,2,1,1,1,2,2,1,1,1,1,1,1,0,1,1,0,2,0,2,1,1,2,1,1,1,0,2,2,1,1,1,2,2,1,2,0,1,3,0,0,1,1,1,1,1,2,1,1,2,1,1,2,1,2,2,1,2,2,2,2,1,1,0,2,2,2,2,2,1,1,3,2,1,2,0,0,1,2,3,2,2,1,2,1,2,1,2,2,3,2,3,1,2,1,1,2,3,1,2,2,2,2,2,2,2,3,1,1,2,0,2

%N Number of occurrences of the digit(s) with smallest frequency in the n-th Fibonacci number.

%C There can be one or more digits having the minimum frequency.

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

%F a(n) < n log phi / 10 log 10.

%F Heuristically, a(n) = n log phi / 10log 10 + O(sqrt(n)), where the big-O constant is roughly -0.17576.

%e a(98)=1 since Fib(98)=135301852344706746049 and digits 2, 8, 9 occur 1 time (minimum frequency).

%Y Cf. A000045, A180580.

%K nonn,base

%O 1,149

%A _Carmine Suriano_, Jan 21 2011

%E Formulas from _Charles R Greathouse IV_, Jan 21 2011