id:A055874 - OEIS Search Results

Search: id:A055874

Displaying 1-1 of 1 results found.

page 1

a(n) = largest m such that 1, 2, ..., m divide n.

+0
6

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

	OFFSET	`1,2`
	EXAMPLE	`a(12) = 4 because 1, 2, 3, 4 divide 12.`
	CROSSREFS	`Cf. A055881, A055926.` `Sequence in context: A078380 A062356 A055881 this_sequence A066451 A091090 A066075` `Adjacent sequences: A055871 A055872 A055873 this_sequence A055875 A055876 A055877`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Jul 16 2000`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research