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