The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217191 a(n) is the number of digits in the decimal representation of the smallest Fibonacci number that contains n consecutive identical digits. 1
 1, 2, 10, 14, 25, 185, 460, 1357, 13027, 28264, 73895 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Number of digits in Fibonacci(k) is equal to floor(1 + k*log_10((1+sqrt(5))/2)-log_10(sqrt(5))). LINKS MATHEMATICA k = 0; Join[{1}, Table[While[d = IntegerDigits[Fibonacci[k]]; ! MemberQ[Partition[Differences[d], n - 1, 1], Table[0, {n - 1}]], k++]; Length[d], {n, 2, 8}]] (* T. D. Noe, Oct 02 2012 *) PROG (Python) def A217191(n): ....if n == 1: ........return 1 ....else: ........l, y, x = [str(d)*n for d in range(10)], 0, 1 ........for m in range(1, 10**9): ............s = str(x) ............for k in l: ................if k in s: ....................return len(s) ............y, x = x, y+x ........return 'search limit reached' # Chai Wah Wu, Dec 17 2014 CROSSREFS Cf. A000045, A217165, A217175. Sequence in context: A230624 A290143 A160773 * A190043 A217681 A102340 Adjacent sequences:  A217188 A217189 A217190 * A217192 A217193 A217194 KEYWORD nonn,base,hard AUTHOR V. Raman, Sep 27 2012 EXTENSIONS a(10)-a(11) from Chai Wah Wu, Dec 17 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 05:14 EDT 2021. Contains 345125 sequences. (Running on oeis4.)