Search Results for ""

sum_(k=0)^(infty)[((m)_k)/(k!)]^3 = 1+(m/1)^3+[(m(m+1))/(1·2)]^3+... (1) = (Gamma(1-3/2m))/([Gamma(1-1/2m)]^3)cos(1/2mpi), (2) where (m)_k is a Pochhammer symbol and Gamma(z) ...

The even part Ev(n) of a positive integer n is defined by Ev(n)=2^(b(n)), where b(n) is the exponent of the exact power of 2 dividing n. The values for n=1, 2, ..., are 1, 2, ...

A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...

The improvement of the convergence properties of a series, also called convergence acceleration or accelerated convergence, such that a series reaches its limit to within ...

(1-x^2)(d^2y)/(dx^2)-x(dy)/(dx)+alpha^2y=0 (1) for |x|<1. The Chebyshev differential equation has regular singular points at -1, 1, and infty. It can be solved by series ...

Given a sequence {a_n}_(n=1)^infty, a formal power series f(s) = sum_(n=1)^(infty)(a_n)/(n^s) (1) = a_1+(a_2)/(2^s)+(a_3)/(3^s)+... (2) is called the Dirichlet generating ...

The sequence defined by G(0)=0 and G(n)=n-G(G(n-1)). (1) The first few terms for n=1, 2, ... are 1, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, ... (OEIS A005206). This can be ...

The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...