70098

Appears in sequences

• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,17.at n=21A064245
• Number array whose rows are the series reversions of x(1-x)/(1+x)^k, read by antidiagonals.at n=60A107111
• Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n.at n=49A123015
• A(n,k) is the n-th derivative of f_k at x=1, and f_k is the k-th of all functions that are representable as x^x^...^x with m>=1 x's and parentheses inserted in all possible ways; square array A(n,k), n>=0, k>=1, read by antidiagonals.at n=73A215703
• n-th derivative of ((x^x)^x)^x at x=1.at n=7A215704
• Seventh derivative of f_n at x=1, where f_n is the n-th of all functions that are representable as x^x^...^x with m>=1 x's and parentheses inserted in all possible ways.at n=4A215837
• Triangle read by rows, coefficients of polynomials in t = log(x) of the n-th derivative of x^(x^3), evaluated at x = 1. T(n, k) with n >= 0 and 0 <= k <= n.at n=28A293474
• Expansion of (1/x) * Series_Reversion( x*(1-x)/(1+x)^5 ).at n=5A365755
• a(n) = (1/(n+1)) * Sum_{k=0..n} binomial(n+k,k) * binomial(n*(n+1),n-k).at n=5A366012