id:A117825 - OEIS Search Results

Search: id:A117825

Displaying 1-1 of 1 results found.

page 1

Distance from n-th highly composite number (cf. A002182) to nearest prime.

+0
4

1, 0, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 11, 13, 1, 11, 1, 17, 1, 1, 13, 13, 1, 1, 17, 1, 17, 1, 1, 17, 17, 17, 1, 1, 19, 37, 37, 1, 17, 23, 1, 29, 1, 1, 19, 1, 19, 23, 1, 19, 31, 1, 19, 1, 1, 1, 1, 23, 1, 29, 23, 23, 1, 23, 71, 37, 1, 1, 31, 1, 23, 53, 1, 31 (list; graph; listen)

	OFFSET	`1,10`
	COMMENT	`a) Conjecture: entries > 1 will always be prime. The entry will be larger than the largest prime factor of the highly composite number.` `b) Will 1 always be the most common entry?` `c) While a prime may always located close to each highly composite number, is the converse false?` `d) Is there always a prime between successive highly composite numbers?`
	LINKS	`Charles Greathouse IV, Table of n, a(n) for n = 1..19999` `Graeme McRae, Highly Composite Numbers` `Wikipedia, Highly Composite Numbers.` `Wikipedia, Divisor Function (sigma).` `Wikimedia Commons,Alternate plot`
	EXAMPLE	`a(5) = abs(12-11)=1.`
	CROSSREFS	`Sequence in context: A074465 A081229 A109010 this_sequence A010143 A101027 A129408` `Adjacent sequences: A117822 A117823 A117824 this_sequence A117826 A117827 A117828`
	KEYWORD	`nonn`
	AUTHOR	`Bill McEachen, May 01 2006`
	EXTENSIONS	`More terms from Don Reble (djr(AT)nk.ca), May 02 2006`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research