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 A320603 #32 Oct 30 2018 09:43:58
%S A320603 1,1,2,2,6,24,36,20736,20808,8947059130368,8947059171984,
%T A320603 716210897494804754044764041567551881216,
%U A320603 716210897494804754044764059461670225184
%N A320603 a(0) = 1; if n is odd, a(n) = Product_{i=0..n-1} a(i); if n is even, a(n) = Sum_{i=0..n-1} a(i).
%C A320603 Next term is too large to include.
%C A320603 Odd terms are the product of previous terms and even terms are the sum of previous terms.
%H A320603 Iain Fox, <a href="/A320603/b320603.txt">Table of n, a(n) for n = 0..18</a>
%H A320603 Iain Fox, <a href="/A320603/a320603.txt">Table of n, a(n) for n = 0..32</a>
%F A320603 a(n) = a(n-1) + 2*a(n-2), for even n > 2.
%F A320603 a(n) = a(n-1) * a(n-2)^2, for odd n > 1.
%e A320603 5 is odd, so a(5) = 1 * 1 * 2 * 2 * 6 = 24.
%e A320603 6 is even, so a(6) = 1 + 1 + 2 + 2 + 6 + 24 = 36.
%t A320603 a[0]:= 1; a[n_]:= If[OddQ[n], Product[a[j], {j,0,n-1}], Sum[a[j], {j,0,n -1}]]; Table[a[n], {n, 0, 15}] (* _G. C. Greubel_, Oct 19 2018 *)
%o A320603 (PARI) first(n) = my(res = vector(n, i, 1)); for(x=3, n, res[x]=if(x%2, sum(i=1, x-1, res[i]), prod(i=1, x-1, res[i]))); res
%o A320603 (PARI) first(n) = my(res = vector(n, i, 1)); res[3]++; for(x=4, n, res[x]=if(x%2, res[x-1]+2*res[x-2], res[x-1]*res[x-2]^2)); res
%Y A320603 Cf. A039941, A077753, A122961.
%Y A320603 Sum of previous terms: A011782.
%Y A320603 Product of previous terms: A165420.
%K A320603 nonn
%O A320603 0,3
%A A320603 _Iain Fox_, Oct 17 2018