id:A000999 - OEIS Search Results

Search: id:A000999

Displaying 1-1 of 1 results found.

page 1

5^a(n) divides C(2n,n).

+0
1

0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 3, 3, 2, 2, 2, 3, 3, 2, 2, 2, 3, 3, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 3, 3, 2, 2, 2, 3, 3, 2, 2, 2, 3, 3, 1, 1, 1, 2, 2 (list; graph; listen)

	OFFSET	`0,14`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, valuation(binomial(2*n, n), 5))`
	CROSSREFS	`Cf. A000984` `Sequence in context: A137865 A052494 A039998 this_sequence A025451 A006513 A105224` `Adjacent sequences: A000996 A000997 A000998 this_sequence A001000 A001001 A001002`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, R. K. Guy (rkg(AT)cpsc.ucalgary.ca)`
	EXTENSIONS	`More terms from Michael Somos, Jun 27, 2002`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research