login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048475 Let b(n) = A048275(n) = maximal number of divisors of C(n,k) for k=0..n; sequence gives smallest value of k achieving b(n). 1
0, 1, 1, 2, 2, 3, 2, 3, 3, 5, 4, 5, 6, 7, 7, 8, 6, 7, 6, 7, 7, 11, 8, 11, 11, 13, 12, 13, 14, 15, 11, 13, 13, 14, 15, 17, 18, 19, 19, 20, 18, 19, 20, 21, 19, 23, 23, 24, 23, 24, 20, 23, 22, 23, 24, 23, 28, 29, 21, 29, 23, 23, 29, 21, 31, 29, 29, 24, 31, 29, 24, 29, 29, 31, 31, 33 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

EXAMPLE

n=50, the number of divisors of {C[ 50,k ]} is maximal if k=24,26. It is 5184. The central(median) value, A00005[ C[ 50,25 ] ]=4608 is smaller.

CROSSREFS

A000005, A048275, A001405, A048570.

Sequence in context: A029326 A029204 A057334 * A204597 A051698 A046773

Adjacent sequences:  A048472 A048473 A048474 * A048476 A048477 A048478

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 15:58 EST 2012. Contains 205937 sequences.