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 A375761 #7 Sep 02 2024 22:46:27 %S A375761 2,3,6,4,12,72,5,20,240,17280,7,35,700,168000,2903040000,8,56,1960, %T A375761 1372000,230496000000,669139107840000000000,10,80,4480,8780800, %U A375761 12047257600000,2776844687769600000000000,1858095376984393503473664000000000000000000000 %N A375761 Infinite triangle T(n, k), n > 0, k = 1..n, read and filled in the greedy way by rows with distinct positive integers such that for any n > 1, k = 2..n, T(n, k) = T(n-1, k-1) * T(n, k-1). %C A375761 This sequence is a variant of A035312, based on products instead of sums. %C A375761 The value 1 cannot appear (as it would imply a duplicate term). %C A375761 We can always start a new row with a prime number that does not divide prior terms, so the sequence is well defined. %C A375761 Will every integer > 1 appear in the sequence? %H A375761 Rémy Sigrist, <a href="/A375761/a375761.gp.txt">PARI program</a> %e A375761 Triangle T(n, k) begins: %e A375761 2 %e A375761 3 6 %e A375761 4 12 72 %e A375761 5 20 240 17280 %e A375761 7 35 700 168000 2903040000 %e A375761 8 56 1960 1372000 230496000000 669139107840000000000 %o A375761 (PARI) \\ See Links section. %Y A375761 Cf. A035312, A064319, A066117, A375846 (right border), A375857 (left border). %K A375761 nonn,tabl %O A375761 1,1 %A A375761 _Rémy Sigrist_, Aug 27 2024