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 A056819 #17 Mar 21 2024 18:18:04
%S A056819 1,2,3,12,5,120,7,280,63,540,11,83160,13,1456,2145,28080,17,636480,19,
%T A056819 1136960,5985,5544,23,1070845776,525,9100,12825,6237000,29,5320224000,
%U A056819 31,12226400,23529,20196,31465,582876756000,37,28120,38961,44639955360
%N A056819 a(n) = Product_{k|n} (n+1-k).
%H A056819 John Tyler Rascoe, <a href="/A056819/b056819.txt">Table of n, a(n) for n = 1..2000</a>
%F A056819 a(p) = p, for p prime. - _Michel Marcus_, Sep 30 2016
%e A056819 a(6) = (6+1-1) *(6+1-2) *(6+1-3) *(6+1-6) = 6 *5 *4 *1 = 120, since the positive divisors of 6 are 1, 2, 3, 6.
%t A056819 a[n_] := Times @@ ((n + 1 - # &) /@ Divisors[n]); Array[a, 40] (* _Jean-François Alcover_, Sep 30 2016 *)
%o A056819 (PARI) a(n) = my(d=divisors(n)); prod(k=1, #d, n+1-d[k]); \\ _Michel Marcus_, Sep 30 2016
%K A056819 nonn,easy
%O A056819 1,2
%A A056819 _Leroy Quet_, Sep 01 2000