id:A081259 - OEIS Search Results

Search: id:A081259

Displaying 1-1 of 1 results found.

page 1

a(n) is the smallest k such that C(3n,n) divides k!.

+0
1

2, 5, 7, 11, 13, 17, 19, 23, 23, 29, 31, 31, 37, 41, 43, 47, 47, 53, 53, 59, 61, 61, 67, 71, 73, 73, 79, 83, 83, 89, 89, 89, 97, 101, 103, 107, 109, 113, 113, 113, 113, 113, 127, 131, 131, 137, 139, 139, 139, 149, 151, 151, 157, 157, 163, 167, 167, 173, 173, 179, 181 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n) is the largest prime < 3n. More generally the smallest k such that C(mn,n) divides k! is the largest prime < mn.`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=1; while(k!%binomial(3*n, n)>0, k++); k)`
	CROSSREFS	`Cf. A060308.` `Sequence in context: A113543 A004134 A020581 this_sequence A118751 A137519 A045344` `Adjacent sequences: A081256 A081257 A081258 this_sequence A081260 A081261 A081262`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 20 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research