login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A248124
Least integer m > 0 such that gcd(m,n) = 1 and (m+n) | (C(m)+C(n)), where C(k) refers to the k-th Catalan number, binomial(2k,k)/(k+1).
9
1, 19, 1, 20, 1, 95, 1, 4, 1, 242, 241, 478, 1, 23, 1, 5, 7, 109, 1, 17, 1, 227, 467, 37, 1, 209, 1, 330, 2077, 17, 1073, 816, 1, 27, 109, 71, 1, 43, 1, 41, 145, 151, 1, 43, 1, 59, 71, 587, 1, 87, 1775, 344, 1773, 1127, 1, 49, 1
OFFSET
4,2
COMMENTS
Conjecture: a(n) exists for all n > 3.
EXAMPLE
a(5) = 19 since 5 is relatively prime to 19 and 5 + 19 = 24 divides C(5) + C(19) = 42 + 1767263190 = 1767263232 = 24*73635968.
MATHEMATICA
Do[m=1; Label[aa]; If[GCD[m, n]==1&&Mod[CatalanNumber[m]+CatalanNumber[n], m+n]==0, Print[n, " ", m]; Goto[bb]]; m=m+1; Goto[aa]; Label[bb]; Continue, {n, 4, 60}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Oct 01 2014
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy