-8000

Appears in sequences

• Signed triangle used to compute column sequences of array A078741 ((3,3)-Stirling2).at n=24A090219
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 1 as Sum_{k=0..n} T(n,k)*binomial(n,k).at n=32A244118
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n as Sum_{k=0..n} T(n,k)*binomial(n,k).at n=32A244130
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n*(n-1) as Sum(k=0..n)T(n,k)*binomial(n,k).at n=33A244138
• For any composite number n with more than a single prime factor, take the polynomial defined by the product of the terms (x-pi)^ei, where pi are the prime factors of n with multiplicities ei. Integrate this polynomial from the minimum to the maximum value of pi. This sequence lists the values of the integrals that are integer.at n=40A245435
• Coefficients of Hilbert class polynomial H_D(x) as D runs through the numbers -3, -4, -7, -8, -11, -12, ... .at n=6A305474
• Constant of Hilbert class polynomial H_D(x) as D runs through the numbers -3, -4, -7, -8, -11, -12, ... .at n=3A305475
• Expansion of g.f.: 1/Sum_{p prime} x^p.at n=21A352476