Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
The OEIS is supported by the many generous donors to the OEIS 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
LINKS
Table of n, a(n) for n=1..79.
FORMULA
T(n,k) = A005179(A000005(n)+A000005(k)).
EXAMPLE
Triangle begins:
2
4 6
4 6 6
6 16 16 12
4 6 6 16 6
...
MATHEMATICA
A005179 = Cases[Import["https://oeis.org/A005179/b005179.txt", "Table"], {_, _}][[All, 2]];
T[n_, k_] := A005179[[DivisorSigma[0, n] + DivisorSigma[0, k]]];
Table[T[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* Jean-François Alcover, Sep 15 2021 *)
PROG
(PARI) T(n, k) = my(x=numdiv(n)+numdiv(k), y=1); while(numdiv(y)!= x, y++); y; \\ Michel Marcus, Sep 15 2021
CROSSREFS
Cf. A000005, A005179.
Sequence in context: A182043 A337937 A138125 * A083220 A085896 A351491
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 WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified September 28 08:28 EDT 2024. Contains 376288 sequences.
License Agreements, Terms of Use, Privacy Policy