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 A332409 #21 Sep 08 2020 14:31:54
%S A332409 0,0,1,2,0,0,1,6,27,45,71,0,228,73,605,861,956,2376,1199,5235,7137,
%T A332409 5017,21617,40320,49250,72900,94129,253071,125204,188760,786046,
%U A332409 1041600,3306329,2717231,8692580,4869072,10661888,33618132,14333453,66880275,110783982
%N A332409 a(n) = n!! mod Fibonacci(n).
%C A332409 a(n) = 0 for n = 1, 2, 5, 6, 12 (a(n) < 500).
%F A332409 a(n) = n!! mod Fibonacci(n).
%F A332409 where n!! denotes the double factorial of n (n!! = n*a(n-2) for n > 1, a(0) = a(1) = 1), and Fibonacci(n) denotes the n-th Fibonacci number.
%e A332409 For n = 1, a(1) = 1!! mod Fibonacci(1) = 1 mod 1 = 0.
%e A332409 For n = 4, a(4) = 4!! mod Fibonacci(4) = 8 mod 3 = 2.
%t A332409 Table[Mod[n!!,Fibonacci[n]],{n,50}] (* _Harvey P. Dale_, Sep 08 2020 *)
%o A332409 (PARI) a0(n) = my(f=fibonacci(n)); prod(i=0, (n-1)\2, n - 2*i) % f; \\ _Michel Marcus_, Mar 17 2020
%Y A332409 Cf. A000045, A006882, A182213.
%K A332409 nonn,easy
%O A332409 1,4
%A A332409 _Andrew Nelson_, Feb 17 2020