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 A079210 #23 Sep 08 2022 08:45:08 %S A079210 1,1,1,2,1,2,3,6,1,2,3,4,6,8,12,24,1,2,3,4,5,6,8,10,12,15,20,24,30,40, %T A079210 60,120,1,2,3,4,5,6,8,9,10,12,15,16,18,20,24,30,36,40,45,48,60,72,80, %U A079210 90,120,144,180,240,360,720 %N A079210 Positive divisors of n!, listed in increasing order for each n, a new row for each n. %C A079210 Elements per row: 1,1,2,4,8,16,30,... (given by A027423, number of positive divisors of n!) %C A079210 This sequence is the same as A070861 for the first 38 terms, but differs thereafter. %H A079210 Andrew Howroyd, <a href="/A079210/b079210.txt">Table of n, a(n) for n = 0..1979</a> (rows 0..12) %e A079210 First few rows are: %e A079210 1; %e A079210 1; %e A079210 1,2; %e A079210 1,2,3,6; %e A079210 1,2,3,4,6,8,12,24; %e A079210 1,2,3,4,5,6,8,10,12,15,20,24,30,40,60,120; %e A079210 ... %t A079210 Flatten[Table[Divisors[n!],{n,6}]] (* _Harvey P. Dale_, Mar 13 2011 *) %o A079210 (Magma) [Divisors(Factorial(n)): n in [0..10]]; // _Vincenzo Librandi_, Jun 19 2015 %o A079210 (PARI) tabf(nn) = for (n=0, nn, print(divisors(n!))); \\ _Michel Marcus_, Jun 19 2015 %Y A079210 Cf. A027423 (row lengths), A062569 (row sums), A070861. %K A079210 nonn,tabf %O A079210 0,4 %A A079210 Christian van den Bosch (cjb(AT)cjb.ie), Jan 03 2003 %E A079210 a(0)=1 prepended by _Andrew Howroyd_, Jan 26 2022