74382

Appears in sequences

• Coefficient of x^5 in expansion of (1 + x + x^2)^n.at n=20A000574
• Number of reversible strings with n-1 beads of 2 colors. 4 beads are black. String is not palindromic.at n=40A032091
• Numbers k such that 161*2^k-1 is prime.at n=24A050832
• Seventh diagonal (m=6) of triangle A084938; a(n) = A084938(n+6,n) = (n^6 + 45*n^5 + 925*n^4 + 11475*n^3 + 92314*n^2 + 413640*n)/720.at n=11A090392
• Triangle of Generalized Runyon numbers R_{n,k}^(3) read by rows.at n=32A173020
• Triangular array read by rows: T(n,k) is the number of forests of rooted trees on n labeled nodes with exactly k isolated nodes; n>=0, 0<=k<=n.at n=29A219034
• E.g.f.: -exp(-x)*LambertW(-x).at n=7A277474
• Number of n-element subsets of [n+4] having an even sum.at n=41A282080
• 3-parking triangle T(r, i, 3) read by rows: T(r, i, k) = (r + 1)^(i-1)*binomial(k*(r + 1) + r - i - 1, r - i) with k = 3 and 0 <= i <= r.at n=23A329059
• Irregular triangle read by rows: T(n,k) is the number of unlabeled n-vertex hypergraphs (or set systems) with k hyperedges (none of which is empty), 0 <= k <= 2^n-1.at n=39A371830
• Irregular triangle read by rows: T(n,k) is the number of unlabeled n-vertex hypergraphs (or set systems) with k hyperedges (none of which is empty), 0 <= k <= 2^n-1.at n=54A371830