Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092989
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092989 Tau(n*A092988(n)). Maximal value attained by the number of divisors of n*k, k < n. +0
2
2, 4, 6, 6, 8, 8, 10, 12, 12, 8, 16, 12, 16, 18, 20, 12, 18, 12, 24, 24, 18, 12, 24, 24, 20, 24, 24, 16, 32, 16, 28, 24, 24, 32, 36, 18, 24, 24, 36, 18, 40, 18, 32, 36, 24, 18, 40, 30, 36, 32, 36, 20, 40, 40, 48, 32, 24, 20, 48, 24, 32, 48, 42, 40, 48, 24, 40, 36, 48, 24, 60, 24 (list; graph; listen)
OFFSET

2,1

MATHEMATICA

Do[x = y = 0; For[k = 1, k < n, k++, d = Length[Divisors[n*k]]; If[d > x, x = d; y = k]]; Print[x], {n, 2, 50}] (Propper)

CROSSREFS

Cf. A092988.

Sequence in context: A092517 A128558 A090346 this_sequence A065558 A035280 A020887

Adjacent sequences: A092986 A092987 A092988 this_sequence A092990 A092991 A092992

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 28 2004

EXTENSIONS

35 more terms from Ryan Propper (rpropper(AT)stanford.edu), Jul 25 2005

More terms from David Wasserman (dwasserm(AT)earthlink.net), Aug 22 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research