1075648

Appears in sequences

• Discriminants of totally real sextic fields.at n=13A023686
• Numbers of form 7^i*8^j with i, j >= 0, sorted.at n=30A036566
• Coefficient triangle for certain polynomials.at n=34A055858
• a(n) = 2*(2n)^(n-2).at n=6A097629
• Totally multiplicative sequence with a(p) = 7*(p+2) for prime p.at n=39A167308
• Discriminant of minimal polynomial of 2*cos(Pi/n) (see A187360).at n=13A193681
• Number of nX3 0..1 arrays with antidiagonals unimodal.at n=6A223564
• Number of nX7 0..1 arrays with antidiagonals unimodal.at n=2A223568
• T(n,k)=Number of nXk 0..1 arrays with antidiagonals unimodal.at n=38A223569
• T(n,k)=Number of nXk 0..1 arrays with antidiagonals unimodal.at n=42A223569
• Discriminants of the minimal polynomials of 2*sin(2*Pi/n) for n >= 1.at n=6A232627
• Discriminants of the minimal polynomials of 2*sin(2*Pi/n) for n >= 1.at n=13A232627
• T(n,k) is the number of labeled connected posets of n labeled elements with k covering relations (n>=1, k>=0). Triangle read by rows.at n=34A342588
• Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^(k^5).at n=13A343285
• Dirichlet g.f.: Product_{k>=2} (1 + k^(-s))^(k^5).at n=13A343325
• Triangle read by rows: T(n,k) is the number of weakly connected acyclic digraphs on n labeled nodes with k arcs, k=0..n*(n-1).at n=47A350909
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A052750.at n=42A384718