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 A119265 #10 Sep 19 2021 22:03:16 %S A119265 1,1,3,1,3,9,1,3,5,15,1,3,9,27,81,1,3,5,9,15,45,1,3,9,27,81,243,729,1, %T A119265 3,5,7,15,21,35,105,1,3,5,9,15,25,45,75,225,1,3,5,9,15,27,45,81,135, %U A119265 405,1,3,9,27,81,243,729,2187,6561,19683,59049,1,3,5,7,9,15,21,35,45,63,105 %N A119265 Triangle read by rows, 1<=k<=n: T(n,k) = k-th divisor of the smallest odd number with exactly n divisors, A038547. %H A119265 Jean-François Alcover, <a href="/A119265/b119265.txt">Table of n, a(n) for n = 1..5050</a> %F A119265 T(n,1) = 1; T(n,n) = A038547(n); %F A119265 T(n,k) = A027750(A006218(A038547(n)-1) + k). %t A119265 A038547 = Cases[Import["https://oeis.org/A038547/b038547.txt", "Table"], {_, _}][[All, 2]]; %t A119265 row[n_] := row[n] = Divisors[A038547[[n]]]; %t A119265 T[n_, k_] := row[n][[k]]; %t A119265 Table[T[n, k], {n, 1, 100}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Sep 19 2021 *) %Y A119265 Cf. A081532, A000005, A005408. %K A119265 nonn,tabl %O A119265 1,3 %A A119265 _Reinhard Zumkeller_, May 11 2006