id:A056043 - OEIS Search Results

Search: id:A056043

Displaying 1-1 of 1 results found.

page 1

Let k be largest number such that k^2 divides n!; a(n) = k/[n/2]!.

+0
1

1, 1, 1, 1, 1, 2, 2, 1, 3, 6, 6, 2, 2, 2, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 10, 10, 30, 30, 30, 12, 12, 3, 3, 6, 30, 10, 10, 10, 30, 6, 6, 2, 2, 2, 30, 60, 60, 30, 210, 42, 42, 42, 42, 28, 28, 2, 2, 4, 4, 4, 4, 4, 84, 21, 21, 14, 14, 14, 42, 6, 6, 2, 2, 2, 10, 10, 70, 140, 140, 14, 126, 126 (list; graph; listen)

	OFFSET	`1,6`
	FORMULA	`a(n)=A000188(n!)/Floor[n/2]!=A055772(n)/[A000142(A001057(n)]^2`
	EXAMPLE	`n=7, 7!=5040=144*35, so 12 is its largest square-root-divisor, A000188(5040) and it is divisible by 6=3! and a(7)=2, the quotient, 12/3!.`
	CROSSREFS	`A000142, A000188, A001057, A055772, A001405.` `Sequence in context: A163649 A110858 A008279 this_sequence A158497 A110564 A007441` `Adjacent sequences: A056040 A056041 A056042 this_sequence A056044 A056045 A056046`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 25 2000`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research