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 A275786 #11 Sep 08 2022 08:46:17
%S A275786 1,3,6,30,15,378,28,1080,270,2475,66,294840,91,8820,10800,146880,153,
%T A275786 2908710,190,5197500,38808,50094,276,3184272000,4875,95823,102060,
%U A275786 35809200,435,17401230000,496,77552640,222156,273105,264600,1511016670800,703,422370,425880
%N A275786 a(n) = Product_{d|n} T(d) where T(x) = x*(x+1)/2 = A000217(x) = x-th triangular number.
%C A275786 Conjecture: the sequence is injective (all terms of this sequence occur only once).
%H A275786 Jaroslav Krizek, <a href="/A275786/b275786.txt">Table of n, a(n) for n = 1..1000</a>
%F A275786 a(p) = A000217(p) = p*(p+1)/2 for a prime p.
%e A275786 a(4) = 30 because the divisors of 4 are: 1, 2 and 4; and T(1)*T(2)*T(4) = 1*3*10 = 30.
%p A275786 f:= n -> convert(map(t -> t*(t+1)/2,numtheory:-divisors(n)),`*`):
%p A275786 map(f, [$1..100]); # _Robert Israel_, Aug 09 2016
%t A275786 t[n_]:=Divisors[n]*(Divisors[n]+1)/2;a[n_]:=Times@@t[n];Array[a,50] (* _Ivan N. Ianakiev_, Aug 15 2016 *)
%o A275786 (Magma) [(&*[d*(d+1) div 2: d in Divisors(n)]): n in [1..100]]
%Y A275786 Cf. A000217, A007437 (Sum_{d|n} T(d)).
%K A275786 nonn
%O A275786 1,2
%A A275786 _Jaroslav Krizek_, Aug 09 2016