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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A236242 Numbers m with C(2*m, m) + prime(m) prime, where C(2*m, m) = (2*m)!/(m!)^2. 6
5, 6, 7, 8, 12, 13, 19, 69, 91, 102, 116, 119, 171, 198, 216, 222, 278, 299, 338, 584, 722, 774, 874, 978, 1004, 1163, 1268, 1492, 1836, 1932, 1966, 2982, 3508, 3964, 4264, 4894, 5028, 8236, 8552, 8639, 12749, 14017, 14402, 18150, 18321, 18514, 18979, 20935, 21815, 21828, 21890, 30734 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
According to the conjecture in A236241, this sequence should have infinitely many terms. The prime C(2*a(52),a(52)) + prime(a(52)) = C(61468, 30734) + prime(30734) has 18502 decimal digits.
For primes of the form C(2*m, m) + prime(m), see A236245.
See also A236248 for a similar sequence.
LINKS
Zhi-Wei Sun, Problems on combinatorial properties of primes, arXiv:1402.6641 [math.NT], 2014-2016.
EXAMPLE
a(1) = 5 since C(2*1,1) + prime(1) = 4, C(2*2,2) + prime(2) = 9, C(2*3,3) + prime(3) = 25 and C(2*4,4) + prime(4) = 77 are all composite, but C(2*5,5) + prime(5) = 252 + 11 = 263 is prime.
MATHEMATICA
n=0; Do[If[PrimeQ[Binomial[2m, m]+Prime[m]], n=n+1; Print[n, " ", m]], {m, 1, 10000}]
Select[Range[9000], PrimeQ[Binomial[2#, #]+Prime[#]]&] (* Harvey P. Dale, Jan 18 2016 *)
CROSSREFS
Sequence in context: A130206 A178502 A047322 * A309102 A080703 A284682
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Jan 20 2014
EXTENSIONS
a(41)-a(52) from bfile by Robert Price, Aug 31 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)