id:A139770 - OEIS Search Results

Search: id:A139770

Displaying 1-1 of 1 results found.

page 1

Smallest number having at least as many divisors an n.

+0
2

1, 2, 2, 4, 2, 6, 2, 6, 4, 6, 2, 12, 2, 6, 6, 12, 2, 12, 2, 12, 6, 6, 2, 24, 4, 6, 6, 12, 2, 24, 2, 12, 6, 6, 6, 36, 2, 6, 6, 24, 2, 24, 2, 12, 12, 6, 2, 48, 4, 12, 6, 12, 2, 24, 6, 24, 6, 6, 2, 60, 2, 6, 12, 24, 6, 24, 2, 12, 6, 24, 2, 60, 2, 6, 12, 12, 6, 24, 2, 48, 12, 6, 2, 60, 6, 6, 6, 24, 2 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Similar to A140635, except that a(n) is allowed to have more divisors than n.` `a(n)<=n for all n. Moreover, a(n)=n if and only if n belongs to A061799 (or equivalently A002182).`
	FORMULA	`a(n) = A061799(A000005(n))`
	EXAMPLE	`16 has 5 divisors; smallest number with at least 5 divisors is 12 with 6 divisors`
	CROSSREFS	`Cf. A000005, A002182, A061799, A140635.` `Sequence in context: A074369 A073348 A122457 this_sequence A140635 A002322 A127835` `Adjacent sequences: A139767 A139768 A139769 this_sequence A139771 A139772 A139773`
	KEYWORD	`nonn`
	AUTHOR	`J. Lowell (jhbubby(AT)mindspring.com), May 20 2008`
	EXTENSIONS	`Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), May 24 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research