|
|
A098037
|
|
Number of prime divisors, counted with multiplicity, of the sum of two consecutive primes.
|
|
4
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Clearly sum of two consecutive primes prime(x) and prime(x+1) has more than 2 prime divisors for all x > 1.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Prime(2) + prime(3) = 2*2*2, 3 factors, the second term in the sequence.
|
|
MATHEMATICA
|
PrimeOmega[Total[#]]&/@Partition[Prime[Range[110]], 2, 1] (* Harvey P. Dale, Jun 14 2011 *)
|
|
PROG
|
(PARI) b(n) = for(x=1, n, y1=(prime(x)+prime(x+1)); print1(bigomega(y1)", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|