id:A141345 - OEIS Search Results

Search: id:A141345

Displaying 1-1 of 1 results found.

page 1

Distance from the n-th highly composite number, A002182(n), to the next prime.

+0
1

1, 1, 1, 1, 1, 5, 1, 5, 1, 7, 1, 1, 7, 7, 13, 17, 13, 1, 11, 1, 11, 1, 1, 19, 13, 1, 11, 1, 17, 1, 29, 13, 13, 1, 1, 17, 13, 23, 17, 19, 17, 17, 19, 1, 19, 23, 37, 53, 1, 17, 29, 43, 29, 1, 19, 19, 1, 23, 23, 1, 41, 41, 1, 53, 29, 19, 19, 23, 23, 47, 29, 23, 37, 1, 59, 71, 41, 1, 29, 37 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`It appears that (1) every term is either 1 or a prime and (2) every prime greater than 3 appears. Note that a prime can occur only a finite number of times. Similar to Fortune's conjecture (A005235) and McEachen's conjecture (A117825).`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	CROSSREFS	`Sequence in context: A095118 A100947 A096940 this_sequence A050340 A021955 A055191` `Adjacent sequences: A141342 A141343 A141344 this_sequence A141346 A141347 A141348`
	KEYWORD	`nonn`
	AUTHOR	`T. D. Noe (noe(AT)sspectra.com), Jun 26 2008`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research