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!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
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

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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)