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

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

Offset

1,149

Comments

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

Links

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

Formula

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

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

Example

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

Crossrefs

Cf. A000045, A180580.

Sequence in context: A353970 A037827 A086074 * A331048 A341593 A288636

Adjacent sequences: A180598 A180599 A180600 * A180602 A180603 A180604

Keyword

nonn,base

Author

Carmine Suriano, Jan 21 2011

Extensions

Formulas from Charles R Greathouse IV, Jan 21 2011

Status

approved