id:A056061 - OEIS Search Results

Search: id:A056061

Displaying 1-1 of 1 results found.

page 1

Number of square divisors of central binomial coefficients.

+0
7

1, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 4, 4, 8, 8, 4, 6, 2, 2, 2, 4, 2, 4, 4, 4, 2, 4, 2, 2, 2, 2, 8, 12, 4, 8, 8, 8, 8, 8, 4, 6, 2, 2, 2, 3, 2, 3, 3, 3, 4, 4, 2, 4, 2, 4, 4, 4, 1, 2, 2, 2, 4, 4, 8, 12, 2, 4, 12, 12, 4, 4, 8, 12, 12, 12, 4, 6, 8, 12, 12, 12, 8, 16, 8, 8, 6 (list; graph; listen)

	OFFSET	`1,6`
	FORMULA	`a(n)=A046951[A001405(n)]=A000005[A000188(A001405(n)]`
	EXAMPLE	`n=27: binomial[27,13]=20058300, its largest square-divisor is 900=30^2 so a(27)=tau[30]=8.`
	CROSSREFS	`Cf. A001405, A046951, A000005, A000188, A056056-A056060.` `Adjacent sequences: A056058 A056059 A056060 this_sequence A056062 A056063 A056064` `Sequence in context: A136450 A131054 A056648 this_sequence A029265 A103648 A133771`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu) Jul 26 2000`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research