login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A069786
Smallest k>n such that C(n+3,n)=A000332(n) divides A000332(k).
0
2, 3, 7, 5, 7, 53, 39, 30, 33, 52, 63, 25, 62, 32, 269, 303, 133, 54, 54, 207, 207, 549, 597, 375, 322, 231, 348, 403, 927, 989, 1053, 1054, 153, 405, 627, 663, 663, 245, 285, 902, 858, 384, 943, 987, 2159, 2253, 2349, 2447, 1222, 1272, 1323, 582, 2013, 2373
OFFSET
1,1
PROG
(PARI) for(s=1, 80, n=s+1; while(frac(n*(n+1)*(n+2)*(n+3)/(s*(s+1)*(s+2)*(s+3)))>0, n++); print1(n, ", "); )
CROSSREFS
Sequence in context: A334126 A341717 A225403 * A128804 A223702 A120726
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, May 01 2002
STATUS
approved