|
|
A251609
|
|
Least k such that prime(k) + prime(k+1) contains n distinct prime divisors.
|
|
0
|
|
|
1, 3, 6, 27, 276, 1755, 24865, 646029, 7946521, 195711271, 4129119136, 198635909763, 6351380968517, 322641218722443, 11068897188590241, 501741852481602261, 24367382928343066431, 1292304206793356882286
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(1) = 1 because prime(1) + prime(2) = 2 + 3 = 5, which is a prime power and so has one distinct prime divisor; the other prime indices yielding a prime power are 2, 18, 564,...(A071352) since prime(2) + prime(3) = 3 + 5 = 2^3, prime(18) + prime(19) = 61 + 67 = 2^7, prime(564) + prime(565)= 4093 + 4099 = 2^13,...
|
|
MAPLE
|
N:= 10^6: # to use primes <= N
Primes:= select(isprime, [2, seq(2*i+1, i=1..(N-1)/2)]):
for i from 1 to nops(Primes)-1 do
f:= nops(numtheory:-factorset(Primes[i]+Primes[i+1]));
if not assigned(A[f]) then A[f]:= i fi
od:
|
|
MATHEMATICA
|
lst={}; Do[k=1; While[Length[FactorInteger[Prime[k]+Prime[k+1]]]!=n, k++]; AppendTo[lst, k], {n, 1, 5}]; lst
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|