id:A055770 - OEIS Search Results

Search: id:A055770

Displaying 1-1 of 1 results found.

page 1

Largest m! which divides n.

+0
2

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

	OFFSET	`1,2`
	EXAMPLE	`3! = 6 divides 12, so a(12) = 6.`
	CROSSREFS	`Cf. A000142, A055881 (values of the m's), A055926, A055874.` `Sequence in context: A126083 A071416 A053589 this_sequence A113766 A112623 A130675` `Adjacent sequences: A055767 A055768 A055769 this_sequence A055771 A055772 A055773`
	KEYWORD	`nonn,easy`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 12 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research