A031324 Decimal digits of successive Fibonacci numbers.
0, 1, 1, 2, 3, 5, 8, 1, 3, 2, 1, 3, 4, 5, 5, 8, 9, 1, 4, 4, 2, 3, 3, 3, 7, 7, 6, 1, 0, 9, 8, 7, 1, 5, 9, 7, 2, 5, 8, 4, 4, 1, 8, 1, 6, 7, 6, 5, 1, 0, 9, 4, 6, 1, 7, 7, 1, 1, 2, 8, 6, 5, 7, 4, 6, 3, 6, 8, 7, 5, 0, 2, 5, 1, 2, 1, 3, 9, 3, 1, 9, 6, 4, 1, 8, 3, 1, 7, 8, 1, 1, 5
Offset: 0
Examples
0.011235813213455891442333776109871597...
Links
- Robert Israel, Table of n, a(n) for n = 0..10000
- Brennan Benfield and Michelle Manes, The Fibonacci Sequence is Normal Base 10, arXiv:2202.08986 [math.NT], 2022.
Programs
-
Maple
F:= [seq(combinat:-fibonacci(n),n=0..50)]: map(t -> op(ListTools:-Reverse(convert(t,base,10))),F); # Robert Israel, Oct 11 2024
-
Mathematica
Flatten[IntegerDigits/@Fibonacci[Range[0,30]]] (* Harvey P. Dale, Jan 28 2015 *)
Formula
An approximation, where each successive Fibonacci number is shifted right by one place (thus causing an overlap when numbers have more than one digit), is given by 10/89 (A021093). - Daniel Forgues, Mar 25 2018
Comments