The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098793 Triangle read by rows, 1<=k<=n: T(n,k) = smallest number having exactly as many divisors as n and k together. 0
 2, 4, 6, 4, 6, 6, 6, 16, 16, 12, 4, 6, 6, 16, 6, 16, 12, 12, 64, 12, 24, 4, 6, 6, 16, 6, 12, 6, 16, 12, 12, 64, 12, 24, 12, 24, 6, 16, 16, 12, 16, 64, 16, 64, 12, 16, 12, 12, 64, 12, 24, 12, 24, 64, 24, 4, 6, 6, 16, 6, 12, 6, 12, 16, 12, 6, 64, 24, 24, 36, 24, 48, 24, 48, 36, 48, 24, 60, 4 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS T(n,k) = A005179(A000005(n)+A000005(k)). LINKS CROSSREFS Sequence in context: A182043 A337937 A138125 * A083220 A085896 A107701 Adjacent sequences:  A098790 A098791 A098792 * A098794 A098795 A098796 KEYWORD nonn,tabl AUTHOR Reinhard Zumkeller, Oct 31 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 09:54 EDT 2021. Contains 344981 sequences. (Running on oeis4.)