|
|
A217165
|
|
a(n) is the least value of k such that the decimal expansion of Fibonacci(k) contains n consecutive identical digits.
|
|
3
|
|
|
0, 10, 49, 66, 118, 883, 2202, 6493, 62334, 135241, 353587, 1162507, 5155873, 7280413, 37356153
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
k = 0; Join[{0}, Table[While[d = IntegerDigits[Fibonacci[k]]; ! MemberQ[Partition[Differences[d], n - 1, 1], Table[0, {n - 1}]], k++]; k, {n, 2, 8}]] (* T. D. Noe, Oct 02 2012 *)
|
|
PROG
|
(Python)
....if n == 1:
........return 0
....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 m
............y, x = x, y+x
........return 'search limit reached'
(C) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|