id:A098793 - OEIS Search Results

Search: id:A098793

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows, 1<=k<=n: T(n,k) = smallest number having exactly as many divisors as n and k together.

+0
1

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; listen)

	OFFSET	`1,1`
	COMMENT	`T(n,k) = A005179(A000005(n)+A000005(k)).`
	CROSSREFS	`Adjacent sequences: A098790 A098791 A098792 this_sequence A098794 A098795 A098796` `Sequence in context: A072984 A018841 A138125 this_sequence A083220 A085896 A107701`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 31 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research