id:A066805 - OEIS Search Results

Search: id:A066805

Displaying 1-1 of 1 results found.

page 1

Least natural number k such that n + sum_{i=1,...,k} Composite[i] is prime, if such k exists; or 0 otherwise.

+0
1

1, 1, 5, 1, 6, 1, 8, 2, 5, 1, 7, 1, 5, 2, 5, 1, 7, 1, 5, 3, 6, 1, 6, 2, 5, 2, 13, 1, 6, 1, 5, 2, 5, 4, 6, 1, 8, 2, 5, 1, 6, 1, 5, 10, 5, 1, 7, 2, 8, 3, 5, 1, 7, 2, 5, 2, 7, 1, 6, 1, 5, 2, 6, 4, 6, 1, 8, 2, 5, 1, 6, 1, 5, 2, 5, 27, 7, 1, 5, 11, 5, 1, 15, 2, 5, 3, 7, 1, 6, 3, 19, 2, 6, 4, 14, 1, 13, 2, 5, 1 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Is a(n) nonzero for all n? If so, then every n can be represented as the difference of a prime and a partial sum of the composite numbers series. See A066753 for a related possible representation of n as the difference of a prime and a partial sum of the prime numbers series.`
	EXAMPLE	`3 + (1 + 4 + 6 + 8 + 9) = 31, a prime and 5 consecutive composite numbers starting with 1 are required to achieve this. Hence a(3) = 5.`
	CROSSREFS	`Cf. A066753.` `Sequence in context: A145825 A101692 A105060 this_sequence A028284 A096462 A066948` `Adjacent sequences: A066802 A066803 A066804 this_sequence A066806 A066807 A066808`
	KEYWORD	`nonn`
	AUTHOR	`Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 19 2002`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), Jun 12 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research