This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A276811 #36 Nov 30 2016 06:12:05
%S A276811 1,1,2,1,3,4,31,20,47,5832,322,84,4576568315415066934826490,324,843,
%T A276811 480,3769607182320,2209,
%U A276811 707932145558030519866865515025923563263974776037874477588352,69670959389872974262939756520,39603
%N A276811 a(n) = sigma(Fibonacci(k))/Fibonacci(n) where k is the least number such that Fibonacci(n) divides sigma(Fibonacci(k)), or -1 if no such k exists.
%C A276811 Least k such that Fibonacci(n) divides sigma(Fibonacci(k)) are 1, 1, 4, 3, 6, 8, 12, 14, 17, 27, 23, 20, 131, 26, 29, 28, 77, 34, 305, 158, 43, ...
%e A276811 a(7) = 31 because least k such that Fibonacci(7) divides sigma(Fibonacci(k)) is 12 and sigma(Fibonacci(12))/Fibonacci(7) = 31.
%t A276811 f[n_] := Block[{k = 1, fn = Fibonacci@ n}, While[ds = DivisorSigma[1, Fibonacci[k]]; Mod[ds, fn] > 0, k++]; ds/fn]; Array[f, 21] (* _Robert G. Wilson v_, Nov 06 2016 *)
%Y A276811 Cf. A000045, A063477, A277261.
%K A276811 nonn
%O A276811 1,3
%A A276811 _Altug Alkan_, Nov 05 2016