Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Aug 20 2021 22:49:56
%S 1,2,5,8,12,15,20,24,25,32,36,44,48,50,56,60,63,72,80,84,95,96,104,
%T 108,110,120,125,128,135,140,144,152,155,168,175,180,185,192,200,204,
%U 207,209,216,224,228,240,252,264,276,279,288,300,320,323,324,336,360,368
%N Numbers k that divide Sum_{j=1..k} Fibonacci(j*k).
%H Vaclav Kotesovec, <a href="/A087347/b087347.txt">Table of n, a(n) for n = 1..184</a>
%H Vaclav Kotesovec, <a href="/A087347/a087347.jpg">Plot of a(n)/(n*log(n)) for n = 2..184</a>
%F Conjecture: a(n) is asymptotic to c*n*log(n) with c around 1.3. [This conjecture is probably false, see plot. - _Vaclav Kotesovec_, Feb 16 2019]
%t Select[Range[380],Divisible[Sum[Fibonacci[# k],{k,#}],#]&] (* _Harvey P. Dale_, Aug 16 2011 *)
%K nonn
%O 1,2
%A _Benoit Cloitre_, Oct 20 2003
%E More terms from _Ray Chandler_, Oct 22 2003