Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Dec 24 2016 22:38:02
%S 1,1,1,1,4,4,4,4,16,16,16,16,64,64,64,64,1024,1024,1024,1024,4096,
%T 4096,4096,4096,16384,16384,16384,16384,65536,65536,65536,65536,
%U 1048576,1048576,1048576,1048576,4194304,4194304,4194304,4194304,16777216,16777216,16777216
%N a(n) = Product_{i=1..n} A234957(i).
%C This is the generalized factorial for A234957.
%C a(0) = 1 as it represents the empty product.
%H Tyler Ball, Tom Edgar, and Daniel Juda, <a href="http://dx.doi.org/10.4169/math.mag.87.2.135">Dominance Orders, Generalized Binomial Coefficients, and Kummer's Theorem</a>, Mathematics Magazine, Vol. 87, No. 2, April 2014, pp. 135-143.
%F a(n) = Product_{i=1..n} A234957(i).
%F a(n) = 4^(A054893(n)). - _Vaclav Kotesovec_, May 28 2014
%o (Sage)
%o S=[0]+[4^valuation(i,4) for i in [1..100]]
%o [prod(S[1:i+1]) for i in [0..99]]
%Y Cf. A054893, A060818, A060828, A234957.
%K nonn
%O 0,5
%A _Tom Edgar_, May 27 2014