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 A121708 #10 Aug 19 2012 11:17:29
%S A121708 1,2,2,7,2,1,11,3,11,1,29,47,29,1,19,41,19,1,199,23,199,1,521,281,521,
%T A121708 1,31,2207,31,1,3571,107,3571,1,9349,2161,9349,1,211,13201,211,1,
%U A121708 64079,1103,64079,1,15251,90481,15251,1,5779,14503,5779,1,1149851,2521
%N A121708 Numerator of Sum/Product of first n Fibonacci numbers A000045[n].
%C A121708 a(1) = 1 and a(4k+2) = 1 for k>0.
%C A121708 For k >1 a(4k-1) = a(4k+1) = A072183(2k+1) = A061447(2k+1) Primitive part of Lucas(n).
%F A121708 a(n) = numerator( sum(k=1..n, Fibonacci(k)) / prod(k=1..n, Fibonacci(k)) ).
%t A121708 Table[Numerator[Sum[Fibonacci[k],{k,1,n}]/Product[Fibonacci[k],{k,1,n}]],{n,1,100}]
%t A121708 With[{fibs=Fibonacci[Range[60]]},Numerator[Accumulate[fibs]/Rest[ FoldList[ Times,1,fibs]]]] (* This is significantly faster than the first program above *) (* _Harvey P. Dale_, Aug 19 2012 *)
%Y A121708 Cf. A000045, A000032, A079451, A001578, A096362, A058036, A121709, A090585.
%Y A121708 Cf. A061447, A072183.
%K A121708 frac,nonn
%O A121708 1,2
%A A121708 _Alexander Adamchuk_, Aug 16 2006, Sep 21 2006