cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A050815 Number of positive Fibonacci numbers with n decimal digits.

Original entry on oeis.org

6, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 5, 5
Offset: 1

Views

Author

Patrick De Geest, Oct 15 1999

Keywords

Comments

If n>1 then a(n) = 4 or 5. - Robert Gerbicz, Sep 05 2002
The sequence is almost periodic, see also A072353. - Reinhard Zumkeller, Apr 14 2005

Examples

			At length 1 there are 6 such numbers: 1, 1, 2, 3, 5 and 8.
		

Crossrefs

See A098842 for another version.

Programs

  • Mathematica
    Drop[Last/@Tally[Table[IntegerLength[Fibonacci[n]],{n,505}]],-1] (* Jayanta Basu, Jun 01 2013 *)

Formula

Asymptotic mean: lim_{n->oo} (1/n) * Sum_{k=1..n} a(k) = log(10)/log(phi) = 1/A097348 = 4.7849719667... - Amiram Eldar, Jan 12 2022
For n>1, a(n) = 4+[{n*alpha+beta}<{alpha}], where alpha=log(10)/log(phi), beta=log(5)/(2*log(phi)), [X] is the Iverson bracket, {x}=x-floor(x), denotes the fractional part of x, and phi=(1+sqrt(5))/2. - Hans J. H. Tuenter, Jul 20 2025
a(n) = A072354(n+1)-A072354(n), a first-order difference. - Hans J. H. Tuenter, Jul 20 2025