A119265 - OEIS

A119265

Triangle read by rows, 1<=k<=n: T(n,k) = k-th divisor of the smallest odd number with exactly n divisors, A038547.

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, 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, 405, 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

Jean-François Alcover, Table of n, a(n) for n = 1..5050

FORMULA

T(n,1) = 1; T(n,n) = A038547(n);

T(n,k) = A027750(A006218(A038547(n)-1) + k).

MATHEMATICA

A038547 = Cases[Import["https://oeis.org/A038547/b038547.txt", "Table"], {_, _}][[All, 2]];

row[n_] := row[n] = Divisors[A038547[[n]]];

T[n_, k_] := row[n][[k]];