OFFSET
1,3
COMMENTS
LINKS
Paolo P. Lava, Table of n, a(n) for n = 1..200
EXAMPLE
The sum of first 10 Fibonacci numbers is 1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34 + 55 = 143. We need to add at least 17 consecutive Fibonacci numbers, starting from F(11)=89, in order to have 89 + 144 + 233 + 377 + 610 + 987 + 1597 + 2584 + 4181 + 6765 + 10946 + 17711 + 28657 + 46368 + 75025 + 121393 + 196418 = 514085 and 514085 / 143 = 3595.
MAPLE
with(numtheory); with(combinat); ListA226841:= proc(q)
local n, a, b, k, p; a:=0;
for n from 1 to q do a:=a+fibonacci(n); b:=fibonacci(n+1); k:=1;
while not type(b/a, integer) do k:=k+1; b:=b+fibonacci(n+k); od; print(k); od; end: ListA226841(10^4);
CROSSREFS
KEYWORD
nonn
AUTHOR
Paolo P. Lava, Jun 19 2013
STATUS
approved