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 A229338 #10 Mar 05 2015 09:42:19
%S A229338 1,4,9,4096,25,2821109907456,49,281474976710656,531441,
%T A229338 10000000000000000,121,
%U A229338 39939223824273992215667642551956428337968885602521915290518994217942463316460321327052965050967304175616,169,2177953337809371136,6568408355712890625,1461501637330902918203684832716283019655932542976
%N A229338 Product of products of elements of subsets of divisors of n.
%F A229338 Conjecture: a(n) = n^s(n); where s(n) = A057711(tau(n)) = A057711(A000005(n)) = tau(n)*2^(tau(n)-2).
%e A229338 For n = 4; divisors of 4: {1, 2, 4}; subsets of divisors of n: {}, {1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {1, 2, 4}; product of products of elements of subsets = 1*1*2*4*2*4*8*8 = 4096.
%t A229338 Table[Times@@Times@@@Subsets[Divisors[n]],{n,20}] (* _Harvey P. Dale_, Mar 05 2015 *)
%Y A229338 Cf. A229335 (sum of sums of the elements), A229336 (product of sums of the elements), A229337 (sum of products of the elements).
%K A229338 nonn
%O A229338 1,2
%A A229338 _Jaroslav Krizek_, Sep 20 2013