The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Table of n, a(n) for n=1..18. FORMULA a(n) = A000720(A230518(n)). - Amiram Eldar, Feb 17 2019 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: seq(A[j], j=1..max(indices(A))); # Robert Israel, Dec 05 2014 MATHEMATICA lst={}; Do[k=1; While[Length[FactorInteger[Prime[k]+Prime[k+1]]]!=n, k++]; AppendTo[lst, k], {n, 1, 5}]; lst CROSSREFS Cf. A000040, A001221, A071352, A230518, A251600. Sequence in context: A372039 A270889 A097678 * A366560 A074894 A324146 Adjacent sequences: A251606 A251607 A251608 * A251610 A251611 A251612 KEYWORD nonn,more AUTHOR Michel Lagneau, Dec 05 2014 EXTENSIONS a(10)-a(18) from Amiram Eldar, Feb 17 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)