id:A056044 - OEIS Search Results

Search: id:A056044

Displaying 1-1 of 1 results found.

page 1

Let k be largest number such that k^2 divides n!, and let m be largest number such that m! divides k; a(n) = k/m!.

+0
3

1, 1, 1, 1, 1, 2, 2, 1, 3, 1, 1, 2, 2, 2, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 10, 10, 30, 2, 2, 12, 12, 3, 3, 6, 30, 10, 10, 10, 30, 6, 6, 2, 2, 2, 30, 60, 60, 30, 210, 42, 42, 42, 42, 1, 1, 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, 3, 3, 6, 30 (list; graph; listen)

	OFFSET	`1,6`
	FORMULA	`a(n)=A000188(n!)/H!, where H!>=Floor[n/2]! is here the maximal factorial divisor.`
	EXAMPLE	`n=11, 11!=6!6!77 and the largest square root divisor is 6!>Floor[11/2]! a(11)=77, the quotient.`
	CROSSREFS	`A000142, A000188, A055772, A001405, A001057.` `Sequence in context: A077889 A120967 A116687 this_sequence A116685 A051135 A135352` `Adjacent sequences: A056041 A056042 A056043 this_sequence A056045 A056046 A056047`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 25 2000`

page 1

Search completed in 0.002 seconds

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research