id:A056059 - OEIS Search Results

Search: id:A056059

Displaying 1-1 of 1 results found.

page 1

GCD of largest square and square-free part of central binomial coefficients.

+0
7

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

	OFFSET	`1,14`
	FORMULA	`a(n)=A055229[A001405(n)]=GCD[A008833(n), A007913(n)]`
	EXAMPLE	`n=14, binomial[14,7]=3432=8.3.11.13. The largest square divisor is 4,square-free part is 858. So a(14)=GCD[4,858]=2.`
	CROSSREFS	`Cf. A001405, A000188, A008833, A007913, A055229, A055231, A046098, A034974, A056056-A056061.` `Sequence in context: A006466 A086597 A031214 this_sequence A031279 A124778 A037831` `Adjacent sequences: A056056 A056057 A056058 this_sequence A056060 A056061 A056062`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 26 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research