id:A070319 - OEIS Search Results

Search: id:A070319

Displaying 1-1 of 1 results found.

page 1

Max( tau(k) : k=1,2,3,...,n ) where tau(n)=A000005(n) is the number of divisors of x.

+0
1

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

	OFFSET	`1,2`
	FORMULA	`It seems that a(n)/Log(n)^2 is bounded ( for n large enough, (1/2)*Log(n)^2 < a(n) < Log(n)^2 ?) - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 11 2002`
	PROGRAM	`(PARI) a(n)=vecmax(vector(n, k, numdiv(k)))`
	CROSSREFS	`Sequence in context: A061071 A122258 A068509 this_sequence A057142 A098388 A094235` `Adjacent sequences: A070316 A070317 A070318 this_sequence A070320 A070321 A070322`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 11 2002`

page 1

Search completed in 0.005 seconds

Last modified September 7 15:23 EDT 2008. Contains 143483 sequences.

AT&T Labs Research