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.
%I A048569 #10 May 20 2018 03:24:35 %S A048569 1,2,3,4,5,6,10,13,14,15,16,22,26,29,30,37,38,39,40,46,47,48,57,58,85, %T A048569 86,87,93,94,95,97,98,106,107,122,123,124,125,147,148,149,150,157,158, %U A048569 159,178,194,206,214,219,220,226,230,232,247,278,283,284,285,286,316 %N A048569 Values of k for which the number of divisors of the central binomial coefficient C(k, floor(k/2)) exceeds the number of divisors of all other binomial coefficients C(k,j). %C A048569 k is in the sequence if the number of divisors of the central binomial coefficient C(k, floor(k/2)) (i.e., C(k, k/2) for even k, and C(k,(k-1)/2) = C(k,(k+1)/2) for odd k) is greater than the number of divisors of C(k, j) for all other values of j. %e A048569 If n=10 and k=0..10 then A000005(binomial(10,k)) = 1, 4, 6, 16, 16, 18, 16, 16, 6, 4, 1. The maximum value of A000005(binomial(10,k)), i.e., 18 occurs only at k=5, the central coefficient. Thus 10 is in this sequence. %Y A048569 Cf. A000005, A001405, A048274, A034974, A048570. %K A048569 nonn %O A048569 1,2 %A A048569 _Labos Elemer_ %E A048569 Edited by _Jon E. Schoenfield_, May 19 2018