|
Search: id:A081532
|
|
|
| A081532 |
|
Triangle read by rows: let m be smallest number with n divisors, then row n gives divisors of m. |
|
+0
5
|
|
| 1, 1, 2, 1, 2, 4, 1, 2, 3, 6, 1, 2, 4, 8, 16, 1, 2, 3, 4, 6, 12, 1, 2, 4, 8, 16, 32, 64, 1, 2, 3, 4, 6, 8, 12, 24, 1, 2, 3, 4, 6, 9, 12, 18, 36, 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1, 2, 4, 8, 16, 32, 64, 128
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Triangle: T(n,k) = k-th divisor of smallest number having exactly n divisors, 1<=k<=n.
T(n,1)=1, T(n,n)=A005179(n); A000005(T(n,n))=n.
Conjecture: T(n,3) = A023402(n-2) for n>2. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jul 18 2003
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Divisor
|
|
EXAMPLE
|
1; 1,2; 1,2,4; 1,2,3,6; 1,2,4,8,16; 1,2,3,4,6,12; ...
|
|
CROSSREFS
|
Leading diagonal is A005179. Cf. A081533.
Sequence in context: A081517 A104778 A085683 this_sequence A131074 A059268 A123937
Adjacent sequences: A081529 A081530 A081531 this_sequence A081533 A081534 A081535
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 28 2003
|
|
EXTENSIONS
|
More terms from Sam Alexander (amnalexander(AT)yahoo.com), Oct 21 2003
|
|
|
Search completed in 0.002 seconds
|
