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 A007878 #80 Jul 17 2024 09:39:20
%S A007878 1,2,5,16,59,246,1103,5247,26059,133881,706799,3815311,20979619,
%T A007878 117178725,663316190,3798697446,21976689397
%N A007878 Number of terms in discriminant of generic polynomial of degree n.
%C A007878 Here "generic" means that the coefficients are algebraically independent symbols. - _Robert Israel_, Oct 02 2015
%C A007878 At one point it was suggested that this is the same sequence as A039744, but this is wrong. _Dean Hickerson_, Dec 16 2006, comments as follows: (Start)
%C A007878 The claim that A039744 equals the number of monomials in the discriminant is false. The first counterexample is n=4: There are 18 such partitions, but the discriminant has no terms corresponding to the partitions 3+2+2+2+2+1 and 2+2+2+2+2+2, so the number of monomials in the discriminant is only 16.
%C A007878 Columns near the left or right have very few nonzero elements and this adds some restrictions to the partitions.
%C A007878 For example, from column 2 of the matrix, we see that the partition must have at least one term equal to n or n-1. From the last column, it must have at least one term equal to 0 or 1. Maybe the complete list of such conditions is enough; I don't know.
%C A007878 Even if we could figure out exactly which partitions correspond to monomials that occur in the expansion, I can't rule out the possibility that the coefficients of some such monomial could cancel out, further reducing the number of nonzero monomials in the discriminant. (End)
%H A007878 Kinji Kimura, <a href="http://syskiso.fuee.u-fukui.ac.jp/~kkimur/gbrela2013-2.pdf">Computing the general discriminant formula of degree 17</a>, presented at Gröbner Bases, Resultants and Linear Algebra workshop, September 3-6, 2013, Research Institute for Symbolic Computation, Hagenberg, Austria. See <a href="https://www3.risc.jku.at/conferences/gbrela2013/GBRLA_schedule.pdf#page=5">abstract</a> and <a href="http://syskiso.fuee.u-fukui.ac.jp/~kkimur/index-e.html">author's website</a>.
%H A007878 Kinji Kimura, <a href="http://syskiso.fuee.u-fukui.ac.jp/~kkimur/susemi.html">programs written in Maple, Magma, etc.</a>
%e A007878 Discriminant of a_0 + a_1 x + ... + a_n x^n is 1/a_n times the determinant of a particular matrix; for n=4 that matrix is
%e A007878 [ a_4 a_3 a_2 a_1 a_0 0 0 ]
%e A007878 [ 0 a_4 a_3 a_2 a_1 a_0 0 ]
%e A007878 [ 0 0 a_4 a_3 a_2 a_1 a_0 ]
%e A007878 [ 4a_4 3a_3 2a_2 1a_1 0 0 0 ]
%e A007878 [ 0 4a_4 3a_3 2a_2 1a_1 0 0 ]
%e A007878 [ 0 0 4a_4 3a_3 2a_2 1a_1 0 ]
%e A007878 [ 0 0 0 4a_4 3a_3 2a_2 1a_1 ]
%e A007878 It is easy to see that there are no monomials in the expansion of this involving either a_4 * a_3 * a_2^4 * a_1 or a_4 * a_2^6.
%e A007878 The discriminant of the cubic K3*x^3 + K2*x^2 + K1*x + K0 is -27*K3^2*K0^2 + 18*K3*K2*K1*K0 - 4*K2^3*K0 - 4*K3*K1^3 + K2^2*K1^2 which contains 5 monomials. - Bill Daly (bill.daly(AT)tradition.co.uk)
%p A007878 A007878 := proc(n) local x,a,ii; nops(discrim(sum(a[ ii ]*x^ii, ii=0..n), x)) end;
%t A007878 Clear[f, g]; g[0] = f[0]; g[n_Integer?Positive] := g[n] = g[n - 1] + f[n] x^n; myFun[n_Integer?Positive] := Length@Resultant[g[n], D[g[n], x], x, Method -> "BezoutMatrix"]; Table[myFun[n], {n, 1, 8}] (* _Artur Jasinski_, improved by Jean-Marc Gulliet (jeanmarc.gulliet(AT)gmail.com) *)
%o A007878 (Magma) function Disc(n) F := FunctionField(Rationals(),n); R<x> := PolynomialRing(F); f := x^n + &+[ (F.i)*x^(n-i) : i in [ 1..n ] ]; return Discriminant(f); end function; [ #Monomials(Numerator(Disc(n))) : n in [ 1..7 ] ] // _Victor S. Miller_, Dec 16 2006
%o A007878 (Sage)
%o A007878 A = InfinitePolynomialRing(QQ, 'a')
%o A007878 a = A.gen()
%o A007878 for N in range(1, 7):
%o A007878 x = polygen(A, 'x')
%o A007878 P = sum(a[i] * x^i for i in range(N + 1))
%o A007878 M = P.sylvester_matrix(diff(P, x), x)
%o A007878 print(M.determinant().number_of_terms())
%o A007878 # _Georg Muntingh_, Jan 17 2014
%K A007878 nonn,nice,hard,more
%O A007878 1,2
%A A007878 reiner(AT)math.umn.edu
%E A007878 a(9) from Lyle Ramshaw (ramshaw(AT)pa.dec.com)
%E A007878 Entry revised by _N. J. A. Sloane_, Dec 16 2006
%E A007878 a(10) from _Artur Jasinski_, Apr 02 2008
%E A007878 a(11) from _Georg Muntingh_, Jan 17 2014
%E A007878 a(12) from _Georg Muntingh_, Mar 10 2014
%E A007878 a(13)-a(14) from _Seiichi Manyama_, Nov 08 2023
%E A007878 a(15)-a(17) from Kimura (2013) added by _Andrey Zabolotskiy_, Jun 30 2024