|
|
A134775
|
|
Numbers k such that the sum of first k Catalan numbers is a prime.
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) = 2 because C(1) + C(2) = 1 + 2 = 3 is a prime.
a(2) = 9 because C(1) + C(2) + C(3) + C(4) + C(5) + C(6) + C(7) + C(8) + C(9) = 1 + 2 + 5 + 14 + 42 + 132 + 429 + 1430 + 4862 = 6917 is a prime.
|
|
MAPLE
|
for n to 3000 do c[n]:= binomial(2*n, n)/(n+1) end do: a:=proc(n) if isprime(add(c[j], j=1..n))=true then n else end if end proc: seq(a(n), n=1..3000); # Emeric Deutsch, Nov 19 2007
|
|
MATHEMATICA
|
f=0; Do[ f = f + Binomial[ 2n, n ]/(n+1); If[ PrimeQ[f], Print[ {n, f} ] ], {n, 1, 1000} ]
Flatten[Position[Accumulate[CatalanNumber[Range[1000]]], _?PrimeQ]] (* Harvey P. Dale, Jan 28 2013 *)
|
|
CROSSREFS
|
Cf. A134776 (primes that are the sum of first n Catalan numbers).
Cf. A014138 (partial sums of Catalan numbers).
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|