cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A048275 a(n) = maximal value for number of divisors of C(n,k) for k=0..n.

This page as a plain text file.
%I A048275 #14 Mar 06 2017 03:49:27
%S A048275 1,2,2,4,4,6,4,8,12,18,16,24,24,32,24,48,32,60,48,80,96,128,64,160,
%T A048275 192,192,288,480,384,480,192,576,768,768,1024,1536,1152,1536,1536,
%U A048275 2304,1536,2880,2304,2560,3072,3840,2304,3456,3840,5184,6144,9216,5120
%N A048275 a(n) = maximal value for number of divisors of C(n,k) for k=0..n.
%H A048275 Michael De Vlieger, <a href="/A048275/b048275.txt">Table of n, a(n) for n = 1..1000</a>
%e A048275 If n=20, then the number of divisors of C(20,k) is one of {1,6,8,16,24,40,48,64,80}, so a(20) = 80.
%t A048275 Table[Max@ Map[DivisorSigma[0, #] &, Binomial[n, Range[0, n]]], {n, 53}] (* _Michael De Vlieger_, Mar 05 2017 *)
%o A048275 (PARI) a(n) = vecmax(vector(n+1, k, numdiv(binomial(n,k-1)))); \\ _Michel Marcus_, Mar 05 2017
%Y A048275 Cf. A000005, A001405, A034974.
%K A048275 nonn
%O A048275 1,2
%A A048275 _Labos Elemer_