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 A005190 M3456 #64 Mar 19 2025 08:03:07
%S A005190 1,1,4,12,44,155,580,2128,8092,30276,116304,440484,1703636,6506786,
%T A005190 25288120,97181760,379061020,1463609356,5724954544,22187304112,
%U A005190 86981744944,338118529539,1327977811076,5175023913008,20356299454276
%N A005190 Central quadrinomial coefficients: largest coefficient of (1 + x + x^2 + x^3)^n.
%C A005190 The maximal coefficient is that of x^[3n/2]. - _M. F. Hasler_, Jul 23 2007
%C A005190 Let f(m) = ceiling((q+log(q))/log(16)), where q = -log(log(256)/(5*m^2*Pi)) then f(a(n)) = n, for n > 0. - _Miko Labalan_, Oct 07 2024
%D A005190 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 78.
%D A005190 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005190 T. D. Noe, <a href="/A005190/b005190.txt">Table of n, a(n) for n=0..200</a>
%H A005190 V. E. Hoggatt, Jr. and M. Bicknell, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/7-4/hoggatt-a.pdf">Diagonal sums of generalized Pascal triangles</a>, Fib. Quart., 7 (1969), 341-358, 393.
%H A005190 T. Neuschel, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL17/Neuschel/neuschel4.html">A Note on Extended Binomial Coefficients</a>, J. Int. Seq. 17 (2014) # 14.10.4.
%H A005190 Claudia Smith and Verner E. Hoggatt, Jr., <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/17-3/smith.pdf">A Study of the Maximal Values in Pascal's Quadrinomial Triangle</a>, Fibonacci Quart. 17 (1979), no. 3, 264-269.
%H A005190 <a href="/index/Ce#cfn">Index entries for sequences of k-nomial coefficients</a>
%F A005190 Limit_{n -> infinity} a(n+1)/a(n) = 4; for n>2, a(n+1) < 4*a(n). - _Benoit Cloitre_, Sep 28 2002
%F A005190 a(n) ~ 4^n * sqrt(2/(5*Pi*n)). - _Vaclav Kotesovec_, Aug 09 2013
%F A005190 Recurrence: 3*n*(3*n-1)*(3*n+1)*(75*n^3 - 390*n^2 + 635*n - 348)*a(n) = 12*(675*n^5 - 4095*n^4 + 8405*n^3 - 7925*n^2 + 3548*n - 664)*a(n-1) + 16*(n-1)*(2175*n^5 - 13335*n^4 + 29275*n^3 - 27707*n^2 + 11334*n - 2814)*a(n-2) - 640*(n-2)*(n-1)*(15*n^3 - 66*n^2 + 52*n - 15)*a(n-3) - 512*(n-3)*(n-2)*(n-1)*(75*n^3 - 165*n^2 + 80*n - 28)*a(n-4). - _Vaclav Kotesovec_, Aug 09 2013
%t A005190 With[{exp=Total[x^Range[0,3]]},Table[Max[CoefficientList[Expand[exp^n], x]],{n,0,30}]] (* _Harvey P. Dale_, Nov 24 2011 *)
%o A005190 (PARI) a(n)=vecmax(vector(3*n,i,polcoeff((1+x+x^2+x^3)^n,i,x)))
%o A005190 (PARI) A005190(n)=polcoeff((1+x+x^2+x^3)^n,(3*n)>>1) \\ _M. F. Hasler_, Jul 23 2007
%o A005190 (Magma) P<x>:=PolynomialRing(Integers()); [Max(Coefficients((1+x+x^2+x^3)^n)): n in [0..26]]; // _Vincenzo Librandi_, Aug 09 2014
%Y A005190 Cf. A005721 (bisection), A005723 (bisection).
%Y A005190 Row 4 of A077042.
%K A005190 nonn,easy
%O A005190 0,3
%A A005190 _N. J. A. Sloane_