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

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]];
Table[T[n, k], {n, 1, 100}, {k, 1, n}] // Flatten (* Jean-François Alcover, Sep 19 2021 *)

Crossrefs

Cf. A081532, A000005, A005408.

Sequence in context: A087000 A289067 A010282 * A143453 A376499 A248830

Adjacent sequences: A119262 A119263 A119264 * A119266 A119267 A119268

Keyword

nonn,tabl

Author

Reinhard Zumkeller, May 11 2006

Status

approved