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 A163269 #17 Feb 14 2024 14:48:41 %S A163269 1,1,2,1,6,3,1,20,19,4,1,70,141,44,5,1,252,1107,580,85,6,1,924,8953, %T A163269 8092,1751,146,7,1,3432,73789,116304,38165,4332,231,8,1,12870,616227, %U A163269 1703636,856945,135954,9331,344,9,1,48620,5196627,25288120,19611175,4395456 %N A163269 T(n,k) = largest coefficient in the expansion of (1 + ... + x^(n-1))^(2*k). %C A163269 T(n,k) = number of ways the sums of all components of two 1..n k-vectors can be equal. %C A163269 T(n,k) is an odd polynomial in n of order 2*k-1. %C A163269 Examples: %C A163269 T(n,1) = n. %C A163269 T(n,2) = (2/3)*n^3 + (1/3)*n. %C A163269 T(n,3) = (11/20)*n^5 + (1/4)*n^3 + (1/5)*n. %C A163269 T(n,4) = (151/315)*n^7 + (2/9)*n^5 + (7/45)*n^3 + (1/7)*n. %C A163269 Table starts: %C A163269 1 1 1 1 1 ... %C A163269 2 6 20 70 252 ... %C A163269 3 19 141 1107 8953 ... %C A163269 4 44 580 8092 116304 ... %C A163269 5 85 1751 38165 856945 ... %C A163269 ... %H A163269 R. H. Hardin, <a href="/A163269/b163269.txt">Table of n, a(n) for n = 1..3240</a> %F A163269 T(n,k) = A273975(2*k, n, (n-1)*k). - _Andrey Zabolotskiy_, Jan 23 2024 %e A163269 For n = 3 and k = 2, (1 + x + x^2)^(2*2) = x^8 + 4*x^7 + 10*x^6 + 16*x^5 + 19*x^4 + 16*x^3 + 10*x^2 + 4*x + 1, whose largest coefficient is T(3,2) = 19. %o A163269 (PARI) T(n,k) = polcoef(sum(i=0, n-1, x^i)^(2*k), k*(n-1)); \\ _Michel Marcus_, Jan 23 2024 %Y A163269 Removing the leftmost column of A349933 generates this sequence. %Y A163269 Cf. A273975. %K A163269 nonn,tabl %O A163269 1,3 %A A163269 _R. H. Hardin_, Jul 24 2009