id:A069786 - OEIS Search Results

Search: id:A069786

Displaying 1-1 of 1 results found.

page 1

Smallest k>n such that C(n+3,n)=A000332(n) divides A000332(k).

+0
1

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; listen)

	OFFSET	`1,1`
	PROGRAM	`(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: A060940 A069771 A076986 this_sequence A128804 A120726 A060203` `Adjacent sequences: A069783 A069784 A069785 this_sequence A069787 A069788 A069789`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 01 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research