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 A206033 #11 Aug 03 2014 14:01:38
%S A206033 1,2,6,240,120,3326400,5040,4151347200,119750400,19760412672000,
%T A206033 39916800,10802449851605508096000000,6227020800,
%U A206033 1077167364120207360000,1077167364120207360000,842072570832352567099392000000,355687428096000
%N A206033 a(1) =1; for n>=1: a(n) = product of numbers k <= sigma(n) such that k is not equal to sigma(d) for any divisor d of n where sigma = A000203.
%C A206033 In sequence A206032 are multiplied all values of sigma(d) of all divisors d of numbers n, in sequence A206031 are multiplied only distinct values of sigma(d) of all divisors d of numbers n and in sequence a(n) are multiplied numbers k (1<=k<=sigma(n)) such that sigma(d) = k has no solution for neither divisor d of number n.
%e A206033 For n=6 -> divisors d of 6: 1,2,3,6; corresponding values of sigma(d): 1,3,4,12; a(6) = Product of k = 2*5*6*7*8*9*10*11 = 3326400.
%t A206033 Table[Times @@ Complement[Range[DivisorSigma[1, n]], DivisorSigma[1, Divisors[n]]], {n, 100}] (* _T. D. Noe_, Feb 10 2012 *)
%Y A206033 Cf. A184388, A206031, A206032.
%K A206033 nonn
%O A206033 1,2
%A A206033 _Jaroslav Krizek_, Feb 03 2012