id:A098037 - OEIS Search Results

Search: id:A098037

Displaying 1-1 of 1 results found.

page 1

Number of prime divisors, counted with multiplicity, of the sum of two consecutive primes.

+0
2

1, 3, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 4, 4, 5, 5, 7, 3, 6, 4, 5, 3, 3, 4, 4, 4, 6, 3, 6, 3, 3, 4, 7, 5, 4, 7, 4, 4, 6, 6, 4, 8, 4, 5, 3, 3, 5, 5, 4, 4, 7, 4, 3, 5, 4, 6, 3, 4, 4, 8, 6, 3, 6, 5, 7, 3, 5, 5, 5, 4, 4, 4, 5, 3, 3, 3, 4, 6, 5, 6, 4, 8, 4, 5, 3, 3, 5, 5, 4, 3, 4, 3, 5, 3, 4, 3, 5, 5, 7, 6, 7, 3, 5, 4 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Clearly sum of two consecutive primes prime(x) and prime(x+1) has more than 2 prime divisors for all x > 1.`
	EXAMPLE	`Prime(2) + prime(3) = 222, 3 factors, the second term in the sequence.`
	PROGRAM	`(PARI) b(n) = for(x=1, n, y1=(prime(x)+prime(x+1)); print1(bigomega(y1)", "))`
	CROSSREFS	`Cf. A071215.` `Sequence in context: A069239 A010265 A084501 this_sequence A079108 A165605 A128112` `Adjacent sequences: A098034 A098035 A098036 this_sequence A098038 A098039 A098040`
	KEYWORD	`easy,nonn`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Sep 10 2004`
	EXTENSIONS	`Definition corrected by Andrew Plewe, Apr 08 2007.`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research