39697

Appears in sequences

• E.g.f. tan(cos(x)*x) (odd powers only).at n=4A009633
• Numbers whose sum of divisors is a sixth power.at n=24A019424
• Number of binary rooted trees with n nodes and height at most 6.at n=25A036589
• Numbers whose sum of divisors is 6^6 = 46656.at n=21A048256
• Numbers n with omega(n) = omega of 3 nearest larger and 3 nearest smaller neighbors.at n=17A101936
• Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.at n=37A175760
• Number of (n+1) X 6 0..2 arrays with all 2 X 2 subblock sums the same.at n=6A183999
• Number of (n+1) X 8 0..2 arrays with all 2 X 2 subblock sums the same.at n=4A184001
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 913", based on the 5-celled von Neumann neighborhood.at n=30A273768
• Irregular triangle read by rows: Numbers of unbranched k-5-catafusenes.at n=54A323944
• a(n) is the (2n)-th term of the n-fold self-convolution of the Euler totient function phi.at n=8A340994
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows, where T(n,k) = Sum_{j=k..n} 2^(n-j) * Stirling2(n,j) * Stirling2(j,k).at n=31A383206
• Expansion of e.g.f. (exp(f(x)) - 1)^3 / 6, where f(x) = (exp(2*x) - 1)/2.at n=7A383208
• a(n) = Sum_{k=0..n} (-1)^k * (k+1) * binomial(4*n-3*k+1,n-k)/(4*n-3*k+1).at n=7A387982