This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A069786 #6 Mar 30 2012 18:38:57 %S A069786 2,3,7,5,7,53,39,30,33,52,63,25,62,32,269,303,133,54,54,207,207,549, %T A069786 597,375,322,231,348,403,927,989,1053,1054,153,405,627,663,663,245, %U A069786 285,902,858,384,943,987,2159,2253,2349,2447,1222,1272,1323,582,2013,2373 %N A069786 Smallest k>n such that C(n+3,n)=A000332(n) divides A000332(k). %o A069786 (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,","); ) %K A069786 easy,nonn %O A069786 1,1 %A A069786 _Benoit Cloitre_, May 01 2002