34320

Appears in sequences

• Expansion of cosh(x)/cos(tan(x)).at n=4A009182
• Expansion of exp(x)/cos(tan(x)).at n=8A009291
• Doubles (index 2+) under "AGJ" (ordered, elements, labeled) transform.at n=4A032019
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/6 of the elements are <= n/2.at n=24A047169
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/6 of the elements are <= (n-1)/2.at n=24A047180
• a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.at n=32A059270
• a(n) = 3*binomial(2*n, n-1).at n=8A062561
• a(n) = n*(n-1)*(n-3)*(n-5).at n=16A062765
• Number of ternary squarefree necklaces.at n=40A066297
• Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=40A070980
• Triangle read by rows: T(n,k) is the number of 2-stack sortable n-permutations with k runs.at n=48A082680
• Triangle read by rows: T(n,k) is the number of 2-stack sortable n-permutations with k runs.at n=51A082680
• T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.at n=94A089627
• Numbers that can be expressed as the difference of the squares of primes in exactly seven distinct ways.at n=9A092003
• Triangle T(n,k) by rows: coefficient [x^(n-k)] of 2^n * n! *L(n,1/2,x), with L the generalized Laguerre polynomials in the Abramowitz-Stegun normalization.at n=23A098503
• a(n) = binomial(n+3,3)*binomial(n+6,3).at n=7A105939
• a(n) = binomial(n+7,7) * binomial(n+10,10).at n=3A107422
• a(n) = n^5 + 3*n^3 + 2*n = n*(n^2 + 1)*(n^2 + 2).at n=7A120573
• Triangle read by rows: T(n,k)=k*binomial(n-2k,3k) (n>=5, 1<=k<=n/5).at n=40A138778
• Number of binary words of length n containing at least one subword 10^{6}1 and no subwords 10^{i}1 with i<6.at n=46A143286