-992

Appears in sequences

• Reversion of o.g.f. for Bell numbers (A000110) omitting a(0)=1.at n=9A007311
• Expansion of e.g.f. log(sinh(x) + cos(x)).at n=6A013068
• Expansion of e.g.f.: exp(tanh(x)-arctanh(x))=1-4/3!*x^3-8/5!*x^5+160/6!*x^6-992/7!*x^7...at n=7A013496
• E.g.f.: sin(x)*sin(tan(x))/2 (even powers only).at n=4A024301
• Start with 1, add the next number if one gets a prime then add the next number else subtract the next...at n=46A074170
• G.f. A(x) satisfies A(A(A(A(x)))) = B(x) (4th self-COMPOSE of A) such that the coefficients of B(x) consist only of numbers {1,2,3,4}, with B(0) = 0.at n=6A112109
• a(2*n) = A000217(n), a(2*n+1) = -2*A000217(n).at n=63A131259
• Coefficients of a normalized Schwarzian derivative generating the Neretin polynomials: S(f) = (x^2/6) { D^2 log(f(x)) - (1/2) [D log(f(x))]^2 }.at n=41A145900
• Irregular triangle, T(n, k) = [x^k] p(n, x), where p(n, x) = 4*Sum_{j=0..n} A008292(n+1, j) * (x/2)^j * (1-x/2)^(n-j), read by rows.at n=39A147563
• Coefficients of the eighth-order mock theta function T_0(q).at n=51A153155
• Triangle T(n,m) of the coefficients [x^m] of the polynomial ((x-1)*(x+2)*(x+1))^n, 0<=m<=3n.at n=54A166235
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood.at n=37A271888
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 601", based on the 5-celled von Neumann neighborhood.at n=40A272825
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 629", based on the 5-celled von Neumann neighborhood.at n=49A273298
• Convolution square of A073592.at n=19A276551
• Expansion of Product_{n>=1} (1 - (16*x)^n)^(1/4).at n=3A303153
• Expansion of Product_{k>0} (1 - 2*k*x^(2*k))/(1 + (2*k-1)*x^(2*k-1)).at n=21A319860
• Expansion of Sum_{k>=1} x^k/(1 + x^k)^3.at n=49A320900
• First term of n-th difference sequence of (floor(k*r)), r = -sqrt(5), k >= 0.at n=12A325669
• T(n, k) = numerator([x^k] b(n, x)), where b(n, x) = 2^n*Sum_{k=0..n} binomial(n, k) * Bernoulli(k, 1/2) * x^(n-k). Triangle read by rows, for 0 <= k <= n.at n=48A336517